perm filename E81.IN[LET,JMC]1 blob
sn#616090 filedate 1981-10-01 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00438 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00043 00002 ∂01-Jul-81 0943 FFL
C00044 00003 ∂01-Jul-81 1700 FFL
C00045 00004 ∂01-Jul-81 2242 LLW Reference Letter For Bill Gosper
C00049 00005 ∂02-Jul-81 1121 JRA WELCOME BACK
C00050 00006 ∂02-Jul-81 1145 Betty Scott <CSD.BSCOTT at SU-SCORE> Basic A.I. Research NSF Proposal
C00052 00007 ∂02-Jul-81 1147 MAS Tom
C00053 00008 ∂02-Jul-81 1319 MAS Tom
C00054 00009 ∂02-Jul-81 1615 Betty Scott <CSD.BSCOTT at SU-SCORE> NSF renewal
C00056 00010 ∂02-Jul-81 1616 GABRIEL at CMU-20C ARPA
C00058 00011 ∂03-Jul-81 0240 Kenneth Kahn <KEN at MIT-AI> Prolog and Eval
C00060 00012 ∂03-Jul-81 0638 GABRIEL at CMU-20C Show & Tell
C00061 00013 ∂03-Jul-81 2101 Purger exceeding your disk quota
C00062 00014 ∂05-Jul-81 1759 JK
C00063 00015 ∂05-Jul-81 2310 Jerry E. Pournelle <POURNE at MIT-MC>
C00065 00016 ∂06-Jul-81 0207 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #1
C00086 00017 ∂06-Jul-81 1041 FWH
C00087 00018 ∂06-Jul-81 1148 FFL mail jmc,ffl
C00088 00019 ∂06-Jul-81 1421 Brian K. Reid <CSL.BKR at SU-SCORE> Re: Chronicle
C00089 00020 ∂06-Jul-81 1423 Burstall at PARC-MAXC Re:
C00091 00021 ∂06-Jul-81 1645 ADMIN.GORIN at SU-SCORE (Ralph Gorin) Your tapes
C00093 00022 ∂06-Jul-81 2127 OTA
C00094 00023 ∂07-Jul-81 0844 FFL
C00095 00024 ∂07-Jul-81 2057 Oded Anoaf Feingold <OAF at MIT-MC> energy digest
C00104 00025 ∂08-Jul-81 1002 JK arpa visit
C00105 00026 ∂08-Jul-81 1214 CLT blindrobot
C00106 00027 ∂08-Jul-81 1429 CG
C00107 00028 ∂08-Jul-81 1552 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Comp. Programming Project
C00109 00029 ∂08-Jul-81 1658 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Help?
C00110 00030 ∂08-Jul-81 1727 Konolige at SRI-AI tomorrow
C00111 00031 ∂09-Jul-81 0830 FFL
C00112 00032 ∂09-Jul-81 1328 FFL
C00113 00033 ∂09-Jul-81 1404 FFL
C00114 00034 ∂09-Jul-81 1848 BYY reply
C00115 00035 ∂09-Jul-81 1851 BYY reply
C00116 00036 ∂09-Jul-81 1939 Burstall at PARC-MAXC Re:
C00117 00037 ∂10-Jul-81 1051 FFL
C00118 00038 ∂10-Jul-81 2127 Feigenbaum at SUMEX-AIM IJCAI draft program
C00119 00039 ∂11-Jul-81 1831 Robert Elton Maas <REM at MIT-MC> Research anouncement follow-up
C00123 00040 ∂12-Jul-81 1806 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #5
C00142 00041 ∂13-Jul-81 1036 Jake Brown <CSD.JAKE at SU-SCORE> copy of IJCAI program
C00143 00042 ∂13-Jul-81 1152 Nilsson at SRI-AI Prolog
C00146 00043 ∂13-Jul-81 1312 BLEDSOE at SRI-AI s and t problem
C00148 00044 ∂14-Jul-81 0735 Navarro at SRI-AI DEDUCTION MONTH NEWS
C00150 00045 ∂14-Jul-81 1322 FFL
C00151 00046 ∂14-Jul-81 1336 FFL
C00152 00047 ∂15-Jul-81 0039 CSD.MALIK at SU-SCORE meeting
C00154 00048 ∂15-Jul-81 0900 JMC*
C00155 00049 ∂15-Jul-81 1157 FFL
C00156 00050 ∂15-Jul-81 1605 Nilsson at SRI-AI Agreement
C00158 00051 ∂15-Jul-81 1630 FFL
C00159 00052 ∂15-Jul-81 1638 FFL Date of meeting with Machado
C00160 00053 ∂15-Jul-81 1639 FFL
C00161 00054 ∂15-Jul-81 1641 FFL
C00162 00055 ∂15-Jul-81 2249 Wiederhold at SRI-AI Visit
C00166 00056 ∂16-Jul-81 1018 FFL
C00167 00057 ∂16-Jul-81 1139 FFL
C00168 00058 ∂16-Jul-81 1344 FFL
C00169 00059 ∂16-Jul-81 1442 TOB
C00171 00060 ∂16-Jul-81 1512 VRP via Ethernet host 50#300 concurrency verification problem
C00174 00061 ∂16-Jul-81 1805 TOB thanks
C00175 00062 ∂16-Jul-81 2100 JMC*
C00176 00063 ∂17-Jul-81 0818 Navarro at SRI-AI More Deduction News from Nils
C00179 00064 ∂17-Jul-81 0909 FFL
C00180 00065 ∂17-Jul-81 1330 BYY appt
C00181 00066 ∂18-Jul-81 0900 JMC*
C00182 00067 ∂18-Jul-81 0900 JMC*
C00183 00068 ∂18-Jul-81 1427 Oded Anoaf Feingold <OAF at MIT-MC>
C00184 00069 ∂18-Jul-81 1434 LLW Phoning
C00185 00070 ∂19-Jul-81 2135 LGC Appt. Monday?
C00186 00071 ∂20-Jul-81 0535 JRA thanks
C00190 00072 ∂20-Jul-81 0939 TW Comprehensive reading list.
C00192 00073 ∂20-Jul-81 1054 FFL
C00193 00074 ∂20-Jul-81 1109 Denny Brown <CSD.DBROWN at SU-SCORE> tech report deadline
C00194 00075 ∂20-Jul-81 1158 Betty Scott <CSD.BSCOTT at SU-SCORE> Supplemental ARPA funding
C00196 00076 ∂20-Jul-81 1315 FFL
C00197 00077 ∂20-Jul-81 1625 FFL
C00198 00078 ∂20-Jul-81 1637 Konolige at SRI-AI meeting
C00199 00079 ∂20-Jul-81 2303 LGC Commentary on my philosphy paper on forces
C00202 00080 ∂21-Jul-81 0003 Richard M. Stallman <RMS at MIT-AI>
C00203 00081 ∂21-Jul-81 0202 Jerry E. Pournelle <POURNE at MIT-MC>
C00204 00082 ∂21-Jul-81 0208 LGC
C00205 00083 ∂21-Jul-81 0248 POURNE@MIT-MC let me talk you into something...
C00208 00084 ∂21-Jul-81 0644 JRA turning out...
C00212 00085 ∂21-Jul-81 1030 PJH via ROCHESTER where
C00213 00086 ∂21-Jul-81 1221 FFL
C00214 00087 ∂21-Jul-81 1230 Paul.Rosenbloom at CMU-10A Reference for ''Killer heuristic''
C00216 00088 ∂21-Jul-81 1459 Richard M. Stallman <RMS at MIT-AI>
C00217 00089 ∂21-Jul-81 1511 Paul.Rosenbloom at CMU-10A Re: killer heuristic
C00218 00090 ∂21-Jul-81 2130 GABRIEL at CMU-20C dog and pony
C00220 00091 ∂22-Jul-81 0103 Jerry E. Pournelle <POURNE at MIT-MC>
C00221 00092 ∂22-Jul-81 0145 Jerry E. Pournelle <POURNE at MIT-MC>
C00224 00093 ∂22-Jul-81 0708 JRA toronto folks
C00225 00094 ∂22-Jul-81 0907 Konolige at SRI-AI (Kurt Konolige)
C00226 00095 ∂22-Jul-81 1347 Konolige at SRI-AI meeting
C00227 00096 ∂22-Jul-81 1556 Purger exceeding your disk quota
C00228 00097 ∂22-Jul-81 1707 Stan at SRI-AI Re: visit
C00229 00098 ∂22-Jul-81 2358 ME files restored
C00230 00099 ∂23-Jul-81 1009 FFL
C00231 00100 ∂23-Jul-81 1031 Konolige at SRI-AI S+P
C00232 00101 ∂23-Jul-81 1310 HEARN at RAND-AI Herbert Stoyan
C00236 00102 ∂23-Jul-81 1358 Darden at SUMEX-AIM welcome back
C00240 00103 ∂23-Jul-81 1401 Lee Erman <Erman at USC-ISIB> Engelmore editor of AI Mag.
C00244 00104 ∂23-Jul-81 1500 HEARN at RAND-AI
C00245 00105 ∂23-Jul-81 1611 HEARN at RAND-AI
C00247 00106 ∂23-Jul-81 1636 HEARN at RAND-AI
C00248 00107 ∂23-Jul-81 1713 HEARN at RAND-AI
C00249 00108 ∂23-Jul-81 2117 HEARN at RAND-AI
C00250 00109 ∂23-Jul-81 2137 HEARN at RAND-AI
C00252 00110 ∂23-Jul-81 2147 HEARN at RAND-AI
C00253 00111 ∂24-Jul-81 1440 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) AIM reports
C00254 00112 ∂24-Jul-81 1735 Vaughan Pratt <CSD.PRATT at SU-SCORE> Sun organization
C00256 00113 ∂25-Jul-81 0331 Jerry E. Pournelle <POURNE at MIT-MC> council meeting
C00257 00114 ∂25-Jul-81 1000 JMC*
C00258 00115 ∂25-Jul-81 1231 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #14
C00277 00116 ∂25-Jul-81 1723 TOB
C00278 00117 ∂25-Jul-81 1739 TOB
C00279 00118 ∂26-Jul-81 1538 pratt@Shasta via Ethernet
C00287 00119 ∂26-Jul-81 2028 AVB Xerox announcement on Dolphin/1100
C00295 00120 ∂27-Jul-81 0741 DDY
C00296 00121 ∂27-Jul-81 0834 FFL
C00297 00122 ∂27-Jul-81 1041 cjh at CCA-UNIX (Chip Hitchcock) offices and MOTHER JONES
C00300 00123 ∂27-Jul-81 1219 RPG
C00301 00124 ∂27-Jul-81 1727 WIEDERHOLD at SRI-AI Schedule
C00302 00125 ∂27-Jul-81 1802 HEARN at RAND-AI Stoyan Visit
C00305 00126 ∂27-Jul-81 1802 HEARN at RAND-AI
C00306 00127 ∂27-Jul-81 1805 JRP forwarding barwise's mail
C00307 00128 ∂27-Jul-81 2151 ME
C00308 00129 ∂28-Jul-81 1408 PJH via ROCHESTER where
C00309 00130 ∂29-Jul-81 0026 LLW John McCarthy Visit
C00310 00131 ∂29-Jul-81 0615 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #17
C00335 00132 ∂29-Jul-81 1004 energy at MIT-MC question re solar hot water
C00337 00133 ∂29-Jul-81 1018 KGK via SRI-AI corner-quotes
C00338 00134 ∂29-Jul-81 1146 FFL
C00339 00135 ∂29-Jul-81 1319 FFL
C00340 00136 ∂29-Jul-81 1620 Denny Brown <CSD.DBROWN at SU-SCORE> PRC visitor
C00347 00137 ∂30-Jul-81 0814 BLEDSOE at SRI-AI Re: visit
C00348 00138 ∂30-Jul-81 1300 JMC*
C00351 00139 ∂30-Jul-81 1608 FFL
C00360 00140 ∂31-Jul-81 1142 FFL
C00361 00141 ∂01-Aug-81 0053 Jerry E. Pournelle <POURNE at MIT-MC> Helping the Boss
C00363 00142 ∂01-Aug-81 0121 V. Ellen Golden <ELLEN at MIT-MC> Helping the Boss
C00367 00143 ∂01-Aug-81 0207 STEF at DARCOM-KA Re: Helping the Boss
C00370 00144 ∂01-Aug-81 0214 V. Ellen Golden <ELLEN at MIT-MC> Re: Helping the Boss
C00373 00145 ∂01-Aug-81 0842 JRA
C00374 00146 ∂01-Aug-81 1049 CLT
C00375 00147 ∂02-Aug-81 0144 Jerry E. Pournelle <POURNE at MIT-MC> NEW CONFERENCE
C00393 00148 ∂03-Aug-81 0817 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) boxes on fifth floor
C00402 00149 ∂03-Aug-81 1512 Mark Crispin <Admin.MRC at SU-SCORE> Re: loglisp
C00404 00150 ∂03-Aug-81 1517 Mark Crispin <Admin.MRC at SU-SCORE> more on LOGLSP
C00405 00151 ∂03-Aug-81 1521 Konolige at SRI-AI S+P
C00406 00152 ∂04-Aug-81 0103 JK a new EKL
C00407 00153 ∂04-Aug-81 0117 POURNE@MIT-MC (Sent by COMSAT@MIT-MC)
C00408 00154 ∂04-Aug-81 0141 TOB Martin Marietta
C00409 00155 ∂04-Aug-81 0156 TOB ok
C00410 00156 ∂04-Aug-81 0849 Robert Elton Maas <REM at MIT-MC> Teller's recent book ''Energy from Heaven and Earth''
C00411 00157 ∂04-Aug-81 0947 FFL
C00412 00158 ∂04-Aug-81 0956 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Manual of Style
C00413 00159 ∂04-Aug-81 1255 CSD.GENESERETH at SU-SCORE MRS paper
C00414 00160 ∂04-Aug-81 2235 LLW Tomorrow
C00415 00161 ∂05-Aug-81 0206 LLW Visit Scheduling
C00416 00162 ∂05-Aug-81 0747 REG
C00419 00163 ∂05-Aug-81 1139 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Mike Farmwald
C00420 00164 ∂05-Aug-81 1321 FFL
C00421 00165 ∂05-Aug-81 1618 JMM append proof
C00425 00166 ∂06-Aug-81 0832 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
C00426 00167 ∂06-Aug-81 0916 RPG
C00428 00168 ∂06-Aug-81 1213 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
C00430 00169 ∂06-Aug-81 2034 TOB
C00431 00170 ∂07-Aug-81 0848 Vaughan Pratt <CSD.PRATT at SU-SCORE> Sun meeting
C00442 00171 ∂07-Aug-81 1030 Paul Martin <PMARTIN at SRI-AI>
C00443 00172 ∂07-Aug-81 1239 Darden at SUMEX-AIM paper for Steve Stich
C00445 00173 ∂08-Aug-81 0254 JMM associativity of append
C00446 00174 ∂08-Aug-81 1644 CLT JMM etc.
C00447 00175 ∂08-Aug-81 1656 CLT
C00448 00176 ∂08-Aug-81 1744 RGUEST at UTAH-20 my visit/lisp history
C00450 00177 ∂08-Aug-81 1752 JK
C00451 00178 ∂09-Aug-81 0238 TOB gm
C00453 00179 ∂09-Aug-81 0246 TOB
C00457 00180 ∂09-Aug-81 0247 TOB
C00514 00181 ∂09-Aug-81 1416 JMM ekl proof
C00515 00182 ∂09-Aug-81 1522 JMM
C00516 00183 ∂09-Aug-81 1912 RPG via CMU-20C Vacation
C00517 00184 ∂10-Aug-81 0333 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #23
C00541 00185 ∂10-Aug-81 0900 JMC*
C00542 00186 ∂10-Aug-81 0900 JMC*
C00543 00187 ∂10-Aug-81 1003 CLT francs
C00544 00188 ∂10-Aug-81 1300 JMC*
C00545 00189 ∂11-Aug-81 0049 Bob Engelmore <CSD.ENGELMORE at SU-SCORE>
C00546 00190 ∂11-Aug-81 0420 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #24
C00571 00191 ∂11-Aug-81 0920 RGUEST at UTAH-20 VISIT
C00573 00192 ∂11-Aug-81 1033 FFL Checked with Dina Bollas. So far everything is OK on your
C00574 00193 ∂11-Aug-81 1512 FFL
C00575 00194 ∂11-Aug-81 1537 Darden at SUMEX-AIM Re: meeting
C00576 00195 ∂11-Aug-81 1757 JMM
C00577 00196 ∂11-Aug-81 1928 JK another proof of append
C00578 00197 ∂11-Aug-81 2254 Feigenbaum at SUMEX-AIM TECHNOLOGY IN THE SERVICE OF SOCIETY
C00585 00198 ∂12-Aug-81 0357 JMM yet another ..
C00586 00199 ∂12-Aug-81 1008 FFL
C00587 00200 ∂12-Aug-81 1148 FFL
C00588 00201 ∂12-Aug-81 1406 JK append
C00589 00202 ∂12-Aug-81 1427 FFL
C00590 00203 ∂12-Aug-81 1521 JMM append
C00593 00204 ∂12-Aug-81 1610 Wiederhold at SUMEX-AIM (Response to message)
C00597 00205 ∂12-Aug-81 1830 Wiederhold at SUMEX-AIM (Response to message)
C00598 00206 ∂12-Aug-81 2223 JMM the final solution
C00599 00207 ∂13-Aug-81 0625 ZM Search Committee
C00600 00208 ∂13-Aug-81 0625 ZM Search Committee
C00601 00209 ∂13-Aug-81 0929 FFL
C00602 00210 ∂13-Aug-81 0951 CLT
C00603 00211 ∂13-Aug-81 1042 Sharon.Burks at CMU-10A Distinguished Lecture
C00605 00212 ∂13-Aug-81 1157 DDY your thesis
C00607 00213 ∂13-Aug-81 1408 FFL
C00608 00214 ∂13-Aug-81 1501 FFL
C00609 00215 ∂13-Aug-81 1559 100 : Peter Suzman
C00610 00216 ∂13-Aug-81 1703 Konolige at SRI-AI (Kurt Konolige)
C00612 00217 ∂13-Aug-81 2038 JK
C00614 00218 ∂13-Aug-81 2043 JK
C00615 00219 ∂13-Aug-81 2049 JK
C00616 00220 ∂13-Aug-81 2154 JK bug fixed
C00617 00221 ∂14-Aug-81 0837 Wiederhold at SUMEX-AIM bulk store
C00618 00222 ∂14-Aug-81 0843 FFL
C00619 00223 ∂14-Aug-81 0930 FFL
C00620 00224 ∂14-Aug-81 1039 FFL
C00621 00225 ∂14-Aug-81 1044 Bobrow at PARC-MAXC AI meeting at IHCAI
C00626 00226 ∂14-Aug-81 1553 FFL
C00627 00227 ∂15-Aug-81 1022 Edward Feigenbaum <CSD.FEIGENBAUM at SU-SCORE> books returned by Hi Yamada
C00631 00228 ∂16-Aug-81 1836 HEARN at RAND-AI
C00632 00229 ∂16-Aug-81 2018 HEARN at RAND-AI
C00633 00230 ∂17-Aug-81 0045 Feigenbaum at SUMEX-AIM AAAI COUNCIL MEETING AGENDA
C00637 00231 ∂17-Aug-81 0853 HEARN at RAND-AI
C00638 00232 ∂17-Aug-81 0853 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Guggenheim Fellowships
C00640 00233 ∂17-Aug-81 0910 Sharon.Burks at CMU-10A
C00642 00234 ∂17-Aug-81 0910 JMC*
C00643 00235 ∂17-Aug-81 1002 TW Comprehensive reading list
C00644 00236 ∂17-Aug-81 1108 TW Comprehensive MTC readings
C00646 00237 ∂17-Aug-81 1124 FFL MESSAGE FOR A. COLMERAUER FROM LARRY TESLER
C00647 00238 ∂17-Aug-81 1125 FFL
C00648 00239 ∂17-Aug-81 1144 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Winter Quarter
C00649 00240 ∂17-Aug-81 1144 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) CS258
C00650 00241 ∂17-Aug-81 1128 Baskett at PARC-MAXC Re: [John McCarthy <JMC at SU-AI>: Poole on file server ]
C00658 00242 ∂17-Aug-81 1517 Marvin Minsky <MINSKY at MIT-AI>
C00659 00243 ∂18-Aug-81 0942 DUFFEY at MIT-AI (Roger D. Duffey, II) HUMAN-NETS Digest V4 #31
C00681 00244 ∂18-Aug-81 1526 Sgt. Sally <CSL.LAB.Sally at SU-SCORE> Manager: Stanford Computer Forum
C00684 00245 ∂18-Aug-81 1628 CLT
C00685 00246 ∂18-Aug-81 1640 CLT
C00686 00247 ∂18-Aug-81 1641 CLT
C00687 00248 ∂18-Aug-81 1831 CLT
C00688 00249 ∂19-Aug-81 1453 CSD.CRANGLE at SU-SCORE return of paper
C00689 00250 ∂19-Aug-81 1801 Brian K. Reid <CSL.BKR at SU-SCORE> letterhead
C00690 00251 ∂19-Aug-81 2241 VRP via Ethernet host 50#300 Lambda calculus talk by Albert Meyer
C00692 00252 ∂19-Aug-81 2301 VRP via Ethernet host 50#300
C00695 00253 ∂21-Aug-81 0915 FFL Call from E. Bloom
C00696 00254 ∂21-Aug-81 1533 ZM
C00697 00255 ∂23-Aug-81 0942 RPG via CMU-20C equipment
C00698 00256 ∂24-Aug-81 0108 LWE NS tape.
C00699 00257 ∂24-Aug-81 1054 FFL CALL FROM JERGEN REID FROM IBM, W. GERMANY
C00700 00258 ∂26-Aug-81 1508 FFL CREDIT CARDS
C00706 00259 ∂26-Aug-81 1518 FFL
C00707 00260 ∂26-Aug-81 1825 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) MTC Qual
C00709 00261 ∂27-Aug-81 2122 Mark Crispin <Admin.MRC at SU-SCORE> Extended address LISP compiler
C00711 00262 ∂28-Aug-81 0928 FFL
C00712 00263 ∂29-Aug-81 1425 REG
C00768 00264 ∂29-Aug-81 2139 TOB
C00769 00265 ∂29-Aug-81 2223 Jerry E. Pournelle <POURNE at MIT-MC>
C00774 00266 ∂31-Aug-81 0832 ADMIN.LIBRARY at SU-SCORE avtomatika i Telemekanika
C00776 00267 ∂31-Aug-81 0902 Stan at SRI-AI Re prolog
C00778 00268 ∂31-Aug-81 0915 Stan at SRI-AI More prolog info
C00784 00269 ∂31-Aug-81 0924 Stan at SRI-AI More on PROLOG
C00785 00270 ∂31-Aug-81 1011 FFL
C00786 00271 ∂31-Aug-81 1036 FFL CALL FROM SANDIA - JACK TISCHHAUSER
C00787 00272 ∂31-Aug-81 1757 Peter Tancig <PETER at MIT-AI>
C00788 00273 ∂01-Sep-81 0000 JMC*
C00789 00274 ∂01-Sep-81 0846 FFL Call from Dr. Wald on Aug. 3l
C00791 00275 ∂01-Sep-81 1049 pratt@Shasta via Ethernet
C00792 00276 ∂01-Sep-81 1059 RINDFLEISCH@SUMEX-AIM via Ethernet
C00801 00277 ∂01-Sep-81 1131 RINDFLEISCH@SUMEX-AIM via Ethernet
C00808 00278 ∂01-Sep-81 1336 CSD.GOLUB at SU-SCORE Equipment Committee
C00809 00279 ∂01-Sep-81 1346 CSD.GOLUB at SU-SCORE Correction
C00810 00280 ∂01-Sep-81 1448 RPG
C00811 00281 ∂01-Sep-81 1449 CSD.GOLUB at SU-SCORE Classroom
C00813 00282 ∂01-Sep-81 1514 RPG
C00817 00283 ∂01-Sep-81 1523 reid@Shasta via Ethernet
C00819 00284 ∂01-Sep-81 1540 RINDFLEISCH@SUMEX-AIM via Ethernet
C00821 00285 ∂01-Sep-81 1540 RINDFLEISCH@SUMEX-AIM via Ethernet
C00823 00286 ∂01-Sep-81 1549 ENGELMORE@SUMEX-AIM via Ethernet
C00826 00287 ∂01-Sep-81 1812 RWW
C00828 00288 ∂01-Sep-81 2157 Peter.Andrews at CMU-10A Your axioms for the S and P problem
C00829 00289 ∂02-Sep-81 0414 Alan Bundy <BUNDY at MIT-AI>
C00830 00290 ∂02-Sep-81 0643 Mark Crispin <Admin.MRC at SU-SCORE> Re: Re prolog
C00832 00291 ∂02-Sep-81 0734 pratt@Shasta via Ethernet
C00835 00292 ∂02-Sep-81 0815 Betty Scott <CSD.BSCOTT at SU-SCORE> Re: Classroom
C00837 00293 ∂02-Sep-81 1156 DRF regards from Larry Pfeffer
C00839 00294 ∂03-Sep-81 0022 Jerry E. Pournelle <POURNE at MIT-MC>
C00840 00295 ∂03-Sep-81 1002 CSD.GOLUB at SU-SCORE Binford's Salary
C00843 00296 ∂04-Sep-81 0319 Mark Crispin <Admin.MRC at SU-SCORE> more on extended Lisp
C00844 00297 ∂04-Sep-81 1100 JMC*
C00845 00298 ∂04-Sep-81 1201 TOB
C00846 00299 ∂04-Sep-81 1301 Gene Golub <CSD.GOLUB at SU-SCORE>
C00847 00300 ∂04-Sep-81 1423 ullman@Shasta via Ethernet
C00848 00301 ∂04-Sep-81 1640 ullman@Shasta via Ethernet
C00852 00302 ∂04-Sep-81 1728 CG garland
C00853 00303 ∂04-Sep-81 1745 reid@Shasta via Ethernet
C00854 00304 ∂04-Sep-81 1745 reid@Shasta via Ethernet
C00855 00305 ∂04-Sep-81 2032 DUFFEY at MIT-AI (Roger D. Duffey, II) HUMAN-NETS Digest V4 #42
C00878 00306 ∂05-Sep-81 0944 RDD at MIT-AI (Roger D. Duffey, II) Your HUMAN-NETS-REQUEST : Removal
C00880 00307 ∂05-Sep-81 1528 ullman@Shasta via Ethernet
C00881 00308 ∂05-Sep-81 1528 ullman@Shasta via Ethernet
C00883 00309 ∂05-Sep-81 2211 Marvin Minsky <MINSKY at MIT-AI>
C00884 00310 ∂06-Sep-81 0927 reid@Shasta via Ethernet
C00886 00311 ∂06-Sep-81 1816 ME NS and option.txt
C00887 00312 ∂07-Sep-81 0000 JMC*
C00888 00313 ∂07-Sep-81 1124 Gene Golub <CSD.GOLUB at SU-SCORE> Letter Letter
C00889 00314 ∂07-Sep-81 1142 CLT
C00890 00315 ∂07-Sep-81 2233 Jerry E. Pournelle <POURNE at MIT-MC> McGrath
C00891 00316 ∂08-Sep-81 0830 FFL EXPENSE REPORTS FOR COLMERAUER AND STOYAN
C00892 00317 ∂08-Sep-81 1259 Bobrow at PARC-MAXC Re:
C00895 00318 ∂08-Sep-81 1308 FFL Ticket to New Mexico
C00896 00319 ∂09-Sep-81 0806 Edward Fredkin <EF at MIT-AI>
C00897 00320 ∂09-Sep-81 0839 FFL CALL FROM ENDRES in Germanyy
C00899 00321 ∂09-Sep-81 0900 ENGELMORE@SUMEX-AIM (SuNet) Ownership and Allocation
C00902 00322 ∂09-Sep-81 0928 ullman@Shasta (SuNet) Englemore reply to Reid
C00905 00323 ∂09-Sep-81 1352 Mark Roberts <ADMIN.MDR at SU-SCORE> Prolog tape for McCarthy
C00906 00324 ∂09-Sep-81 1513 FFL CALL FROM ED FREDKIN
C00907 00325 ∂09-Sep-81 1541 FFL CONTEXT ADVISORY COUNCIL MEETING
C00908 00326 ∂09-Sep-81 1610 FFL
C00909 00327 ∂09-Sep-81 2322 Richard M. Stallman <RMS at MIT-AI>
C00911 00328 ∂09-Sep-81 2359 Richard M. Stallman <RMS at MIT-AI>
C00913 00329 ∂10-Sep-81 0053 Richard M. Stallman <RMS at MIT-AI>
C00914 00330 ∂10-Sep-81 0131 Alan Bundy <BUNDY at MIT-AI>
C00915 00331 ∂10-Sep-81 0936 Darden at SUMEX-AIM colloquium possibilities at Maryland
C00917 00332 ∂10-Sep-81 1114 EF@MIT-ML
C00918 00333 ∂10-Sep-81 1227 FFL
C00919 00334 ∂10-Sep-81 1450 reid@Shasta (SuNet) comments from Scott Fahlman on department-wide resources
C00922 00335 ∂10-Sep-81 1631 pratt@Shasta (SuNet) comments from Scott Fahlman on department-wide resources
C00925 00336 ∂10-Sep-81 1651 reid@Shasta (SuNet) facilities
C00929 00337 ∂10-Sep-81 1748 ullman@Shasta (SuNet) meeting
C00930 00338 ∂11-Sep-81 0116 ME Ethernet mail from/to SAIL
C00932 00339 ∂11-Sep-81 0509 Robert Elton Maas <REM at MIT-MC> Compression and noise
C00936 00340 ∂11-Sep-81 1034 FFL
C00937 00341
C00938 00342 ∂12-Sep-81 0103 PMF
C00939 00343 ∂12-Sep-81 1129 RPG@Sail (SuNet) Considerations
C00944 00344 ∂12-Sep-81 2120 LLW Starting Next Week
C00946 00345 ∂13-Sep-81 1045 CLT
C00947 00346 ∂13-Sep-81 1704 Purger exceeding your disk quota
C00949 00347 ∂14-Sep-81 0945 CLT
C00950 00348 ∂14-Sep-81 1126 CSD.ENGELMORE@SU-SCORE (SuNet) Proposed equipment
C00955 00349 ∂14-Sep-81 1238 RPG@Sail (SuNet) Lisp
C00956 00350 ∂14-Sep-81 1431 ENGELMORE@SUMEX-AIM (SuNet) Amended wish list
C00958 00351 ∂14-Sep-81 1431 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) MTC Qual
C00959 00352 ∂14-Sep-81 1522 RINDFLEISCH@SUMEX-AIM (SuNet) Re: Lisp
C00963 00353 ∂14-Sep-81 1530 RPG@Sail (SuNet) Lisp
C00965 00354 ∂14-Sep-81 1907 TW
C00966 00355 ∂14-Sep-81 1936 RPG
C00967 00356 ∂14-Sep-81 2111 JJW EKL Reference Manual
C00968 00357 ∂15-Sep-81 0143 Richard M. Stallman <RMS at MIT-AI>
C00969 00358 ∂15-Sep-81 0417 energy at MIT-MC
C00970 00359 ∂15-Sep-81 0831 FFL AUTOMATIC BANK DEPOSIT OF CHECKS
C00971 00360 ∂15-Sep-81 0916 RPG
C00972 00361 ∂15-Sep-81 1021 Baskett at PARC-MAXC attractive machine offer from DEC
C00977 00362 ∂15-Sep-81 1034 pratt@Shasta (SuNet) CSL reps
C00978 00363 ∂15-Sep-81 1058 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Faculty Meeting, Monday, Sept. 28
C00979 00364 ∂15-Sep-81 1154 Mike Genesereth <CSD.GENESERETH at SU-SCORE> Re: se2
C00980 00365 ∂15-Sep-81 2305 FEIGENBAUM@SUMEX-AIM (SuNet) baskett
C00985 00366 ∂15-Sep-81 2306 ullman@Shasta (SuNet) CSL reps
C00986 00367 ∂15-Sep-81 2307 ENGELMORE@SUMEX-AIM (SuNet) meeting with Bob Kahn
C00987 00368 ∂15-Sep-81 2339 Feigenbaum at SUMEX-AIM retransmission
C00993 00369 ∂16-Sep-81 0057 RPG@Sail (SuNet) Baskett's Lisp Analysis
C00997 00370 ∂16-Sep-81 0810 JRP terminals
C00998 00371 ∂16-Sep-81 0916 RINDFLEISCH@SUMEX-AIM (SuNet) Interlisp VAX Report
C00999 00372 ∂16-Sep-81 1031 FFL
C01000 00373 ∂16-Sep-81 1033 FFL
C01001 00374 ∂16-Sep-81 1222 RPG
C01003 00375 ∂16-Sep-81 1415 RPG I'm
C01004 00376 ∂16-Sep-81 1507 UNTULIS at SRI-AI Re: badge
C01005 00377 ∂16-Sep-81 1435 RINDFLEISCH@SUMEX-AIM (SuNet) 11/750 DEAL
C01006 00378 ∂16-Sep-81 2334 Jerry E. Pournelle <POURNE at MIT-MC> conference
C01008 00379 ∂17-Sep-81 0752 RINDFLEISCH@SUMEX-AIM (SuNet) FYI RE COMMON LISP - PROMPTED BY MASINTER'S INTERLISP VAX RPT
C01011 00380 ∂17-Sep-81 1056 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) MTC Qual Dec. 14
C01012 00381 ∂17-Sep-81 1423 NEUMANN at SRI-KL VERkshop II Berkeley Symposium
C01017 00382 ∂17-Sep-81 1440 ADMIN.BOSACK@SU-SCORE (SuNet) Lab Equipment
C01019 00383 ∂17-Sep-81 1537 FFL
C01020 00384 ∂17-Sep-81 1848 pratt@Diablo (SuNet) equip@shasta -> equip@diablo
C01021 00385 ∂18-Sep-81 1000 FFL
C01022 00386 ∂18-Sep-81 1001 FFL mail jmc,ffl
C01023 00387 ∂18-Sep-81 1003 FFL Call from Endres, of IBM, Germany
C01024 00388 ∂18-Sep-81 1051 FFL
C01025 00389 ∂18-Sep-81 1544 FFL
C01026 00390 ∂18-Sep-81 1606 CLT
C01027 00391 ∂18-Sep-81 2118 ARK Fourth Annual "See You In September" Party
C01029 00392 ∂19-Sep-81 0931 JRP terminals
C01032 00393 ∂19-Sep-81 1553 ullman@Diablo (SuNet) equip@shasta -> equip@diablo
C01033 00394 ∂19-Sep-81 1943 RPG Terminal
C01034 00395 ∂19-Sep-81 2141 CLT aliquots
C01035 00396 ∂19-Sep-81 2308 Jerry E. Pournelle <POURNE at MIT-MC>
C01036 00397 ∂20-Sep-81 1529 CLT
C01037 00398 ∂20-Sep-81 1616 Richard M. Stallman <RMS at MIT-AI> Emacs
C01038 00399 ∂20-Sep-81 1637 TOB VAX buy
C01039 00400 ∂20-Sep-81 1747 TOB
C01042 00401 ∂21-Sep-81 0401 TOB computing
C01044 00402 ∂21-Sep-81 1012 CG disk space
C01046 00403 ∂21-Sep-81 1237 RPG terminal
C01047 00404 ∂21-Sep-81 1251 JK rewriting
C01048 00405 ∂21-Sep-81 1256 RPG
C01049 00406 ∂21-Sep-81 1257 JRP terminal
C01050 00407 ∂21-Sep-81 1251 RWW
C01052 00408 ∂21-Sep-81 1440 REG
C01053 00409 ∂21-Sep-81 2021 Mark Crispin <Admin.MRC at SU-SCORE> PROLOG tape
C01054 00410 ∂21-Sep-81 2105 Mark Crispin <Admin.MRC at SU-SCORE>
C01055 00411 ∂21-Sep-81 2216 LGC 1. Colloquium 2. Castaneda account?
C01057 00412 ∂21-Sep-81 2223 reid@Diablo (SuNet) sun workstations and Dolphins
C01059 00413 ∂22-Sep-81 0823 JK
C01060 00414 ∂22-Sep-81 0906 Gene Golub <CSD.GOLUB at SU-SCORE> call
C01061 00415 ∂22-Sep-81 0915 UNTULIS at SRI-AI New badge
C01062 00416 ∂22-Sep-81 1000 JMC*
C01063 00417 ∂22-Sep-81 1000 JMC*
C01064 00418 ∂22-Sep-81 1401 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) MTC Qual
C01065 00419 ∂22-Sep-81 1814 Richard M. Stallman <RMS at MIT-AI>
C01068 00420 ∂23-Sep-81 0814 FFL Telegram
C01069 00421 ∂23-Sep-81 0900 FFL Telegram
C01070 00422 ∂23-Sep-81 0849 TOB
C01071 00423 ∂23-Sep-81 0956 RPG
C01072 00424 ∂23-Sep-81 1000 RPG
C01073 00425 ∂23-Sep-81 1013 FFL
C01074 00426 ∂23-Sep-81 1014 FFL Fred Abramson computer files
C01075 00427 ∂23-Sep-81 1059 Mark Crispin <Admin.MRC at SU-SCORE> [HEDRICK at RUTGERS (Mngr DEC-20's/Dir LCSR Comp Facility): edit 9-23-81]
C01081 00428 ∂23-Sep-81 1120 EJG Travel to Livermore
C01082 00429 ∂23-Sep-81 1446 Denny Brown <CSD.DBROWN at SU-SCORE> New student support
C01084 00430 ∂23-Sep-81 1542 FFL Money for your ARPA appointees.
C01086 00431 ∂23-Sep-81 1624 EJG Re: ride
C01087 00432 ∂23-Sep-81 1637 RPG
C01088 00433 ∂23-Sep-81 1747 Bobrow at PARC-MAXC Summary of AI Board meeting, 8/25/81, and Journal Status
C01094 00434 ∂23-Sep-81 2046 RPG
C01095 00435 ∂23-Sep-81 2050 RPG students
C01096 00436 ∂23-Sep-81 2055 CLT mvgcd
C01097 00437 ∂23-Sep-81 2232 RPG
C01098 00438 ∂23-Sep-81 2236 RPG
C01100 ENDMK
C⊗;
∂01-Jul-81 0943 FFL
To: JMC, FFL
Prof. Robert Solso from the Psychology Dept. asked if you had a grad
student who could speak with his summer class (tour) about advanced
systems and computer simulation of thought. He will contact you in
July. 7-3457.
∂01-Jul-81 1700 FFL
To: JMC, FFL
Barbara Moore, 7-4378, CIT, called for Michael Carter asking if you
would serve on CONTEXT Advisory Council. There is a letter from
Ed Shaw relating to this which came today.
∂01-Jul-81 2242 LLW Reference Letter For Bill Gosper
To: phw at MIT-AI, DEK at SU-AI, JMC at SU-AI
CC: LLW at SU-AI
Professor Patrick H. Winston
Professor Donald E. Knuth
Professor John McCarthy
Gentlemen:
Our mutual friend Bill Gosper has designated the three of you as former
supervisors or educators of his most familiar with his professional
qualifications and accomplishments.
I would be most grateful for a brief letter-of-reference from you for
Bill, as we have prevailed upon him to accept an Indeterminate Time Staff
Appointment in the S-1 Project at the Lawrence Livermore National
Laboratory, and the Laboratory's moguls require three such references
before they will assent to such appointments. (Indeed, it is widely
believed that only the rather limited enumeration abilities of our New Class
have kept the requirements in this respect down to this level.)
All the other paperwork prerequisite to final review of Bill's appointment
has been completed, so that your response to this request at your early
convenience will be especially appreciated. A Net-mail note to me (LLW @
SU-AI) is speediest and will do perfectly well, but if hard-copy via US
mail (to Dr. Lowell Wood, P. O. Box 808-L-276, Livermore, CA 94550) is
preferable to you, it's certainly agreeable to me.
Thanks very much for your timely consideration of this request.
Sincerely,
Lowell Wood
I have known Bill Gosper for more than ten years, and consider him
the one of the two or three most inventive and dedicated computer mathematicians
around. Indeed it seems that his dedication to always working on
ever new mathematical applications of computers has hindered his pursuing
a conventional academic career. I have no hesitation in recommending him
without qualification.
P.S. to LLW. I have just returned and will call you soon unless you call
me first. If you need a more elaborate version of the Gosper reference,
I will do it.
∂02-Jul-81 1121 JRA WELCOME BACK
TOPIC'S FINE. I'LL HAVE A COUPLE-DOZEN-PAGE OUTLINE OF THE COURSE COMPLETED
IN THE NEXT TWO DAYS. LARRY AND I WILL GIVE IT THE
XEROX POLISH IN THE MEANTIME. CURRENT DRAFT IS ON UCSC[1,JRA] IF YOU'RE ANXIOUS.
IT'S A MORE "PRACTICAL" COURSE THAN I'D LIKE, BUT AT LEAST A MENTION
OF SCHEME, PROLOG, AND λ-CALCULUS. I'M PLANNING TO WORK THEN TILL THEY DROP.
I'LL GET YOU A MAP OF THE CAMPUS. TWO OVERHEAD PROJECTORS ARE AVAILABLE;
DO YOU NEED ANYTHING ELSE? THERE'S A PARTY WED. NIGHT, WHICH WE SHARE
WITH THE ADA GROUP --HOPEFULLY IN A PEACEFUL FASHION. YOU'RE INVITED, OF COURSE.
∂02-Jul-81 1145 Betty Scott <CSD.BSCOTT at SU-SCORE> Basic A.I. Research NSF Proposal
Date: 2 Jul 1981 1143-PDT
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: Basic A.I. Research NSF Proposal
To: JMC at SU-AI
cc: FFL at SU-AI, CSD.BScott at SU-SCORE
I have just talked with Bruce Barnes at NSF re several proposals. He told
me that your renewal will have a start date of 9/1; he couldn't elaborate, since
the paperwork had left his office. Your requested start date was 7/1, so you
are short two months of funding.
I suggest that you should look at the latest commitment and projection report
on the current grant. Fran prepared a copy for you.
Betty
-------
∂02-Jul-81 1147 MAS Tom
He has an appointment with Gananian at 2:15. There will probably be some
students with cars around by then. If not, I will let you know.
Marianne
∂02-Jul-81 1319 MAS Tom
We have arranged for a ride for Tom. Thank you very much for your offer.
Marianne
∂02-Jul-81 1615 Betty Scott <CSD.BSCOTT at SU-SCORE> NSF renewal
Date: 2 Jul 1981 1610-PDT
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: NSF renewal
To: JMC at SU-AI
cc: FFL at SU-AI, CSD.BScott at SU-SCORE
I just now had a call from sponsored projects. In spite of what Bruce Barnes
told me this morning (and I specifically gave him the title of the research
and the proposal number), SPO received your award in this afternoon's mail,
effective 7/1 as requested.
So now I don't know which proposal Barnes was talking about--maybe Richard
Weyrauch's or Chris Goad's. I'll call Barnes again on Monday.
Anyway, your funding is here. It was cut by $2,550 in the materials and
supplies category. We should have the paperwork next week.
Betty
-------
∂02-Jul-81 1616 GABRIEL at CMU-20C ARPA
Date: 2 Jul 1981 1913-EDT
From: GABRIEL at CMU-20C
Subject: ARPA
To: jmc at SU-AI
I don't think that we'll (I'll) be able to use any of that money
this summer since I am currently at CMU working on NIL. I will
be trying to do some of the lisp evalutaion stuff when I can, but
not great guns. I think we should wait until the fall and
pay some student with the funds. I will be trying to get
at least all of the benchmarks that exist now run and timed
on all of the machines that have volunteered.
If you need to have me in California at some specific time, let me
know soon because I can fly back 4 times this summer at LLL
expense for random things.
How was your stay in france? Did you learn anything interesting?
-rpg-
-------
There is to be a show-and-tell for the new ARPA AI program manager
on July 28. Can you come for that and add weight to the Advice Taker
implementation plan? As for France, there were several interesting
things including getting introduced to PROLOG and some work on
non-monotonic reasoning. I have become convinced that there is much
that is interesting in logic programming, and I have brought back
PROLOG and LOGLISP systems to play with.
∂03-Jul-81 0240 Kenneth Kahn <KEN at MIT-AI> Prolog and Eval
Date: 3 July 1981 05:40-EDT
From: Kenneth Kahn <KEN at MIT-AI>
Subject: Prolog and Eval
To: JMC at SU-AI
cc: KEN at MIT-AI
Hi. I also played a little with your Eval in Prolog and removed the cuts.
One interesting problem was to write ASSOC correctly. The problem is that
assoc should only pay attention to the first occurence of the key.
"ff", and "alt" worked fine (and said no to other possibilities) when I
restored your program to how it was when I left and defined assoc as follows:
assoc(X,[],[]).
assoc(X,[[X|Y]|Z],[X|Y]).
assoc(X,[[X1|Y]|V],W) :- X\==X1,assoc(X,V,W).
"\==" means are not the same (like Lisp's Equal not Prolog's unify)
so it recurses only if the keys are different.
The real dificulty in Prolog is to make assoc work when the key or alist is
partially instaniated. In those cases one wants a more general sort of
negation to say X is not equal to X1.
Keep in touch
----ken
∂03-Jul-81 0638 GABRIEL at CMU-20C Show & Tell
Date: 3 Jul 1981 0938-EDT
From: GABRIEL at CMU-20C
Subject: Show & Tell
To: jmc at SU-AI
Ok, I will be in calif on that day. I'm interested to see what sorts of
things people actually do with PROLOG rather than the cartoon types
of things I've seen in the past as tutorials.
-rpg-
-------
∂03-Jul-81 2101 Purger exceeding your disk quota
You are exceeding your disk quota.
Files that occupy space beyond your quota are subject to purging.
If you don't delete some of your files, the purger will.
There will probably be a purge in the next 24 to 48 hours if
there are not more than about 2500 free disk blocks.
Your disk quota is: 4080
Your files occupy 4201
∂05-Jul-81 1759 JK
∂03-Jul-81 1547 JMC
To: LGC, CG, CLT, JK, RWW
ARPA AI wallah here July 28 for show-and-tell.
-------------
I'll be on vacation july 20 - 28 so it's unlikely that I can make it
∂05-Jul-81 2310 Jerry E. Pournelle <POURNE at MIT-MC>
Date: 6 July 1981 02:10-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
To: jmc at SU-AI
Glad you're back. This may interest you...
Date: 4 July 1981 04:27-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
GPS (Global Positioning System) was zeroed out of the
budget by an Armed Forced committee type, apparently acting all
by himself, but with the rest of the House sort of going along.
Query: should we fight to get it restored? Hans Mark
says "it's not my highest priority system. Not my favorite. I'm
for it, but not a LOT for it as a military system."
Duke Kane says he's worked on it for 20 years, that it
revolutionizes warfare, and that it's utterly vital.
It seems to have some decent civilian implications, and
it doesn't look to me to cost that much.
Advice, please? Fairly urgent. We can start a fight on this.
Should we?
I don't know enough about it to have an opinion.
∂06-Jul-81 0207 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #1
Date: 6 JUL 1981 0455-EDT
From: DUFFEY at MIT-ML (Roger D. Duffey, II)
Subject: HUMAN-NETS Digest V4 #1
To: HUMAN-NETS at MIT-AI
HUMAN-NETS Digest Monday, 6 July 1981 Volume 4 : Issue 1
Today's Topics:
Administrivia - On restarting HUMAN-NETS (again!),
Query Reply - Pro Software, Computers and People - Third Wave effects,
Communicating via Network - Insults, Humor - Debugging III
----------------------------------------------------------------------
Date: 6 July 1981 0001-EDT
From: The Moderator <Duffey at MIT-AI>
Subject: Administrivia - On restarting HUMAN-NETS
Let's try that again. I began last week by restarting HUMAN-NETS
after a 3 week hiatus. On Wednesday, 1 July MIT-AI developed
problems with its network connection. As those of you on some of
the other mailing lists know, one manifestation of these problems
was severe garbling of outgoing messages. These problems have
prevented us from using MIT-AI to redistribute mail for the broad
spectrum lists. In order to cope with these problems we were
forced to limit the volume going through the lists. In particular,
I was forced to curtail HUMAN-NETS again because it is entirely
centralized on MIT-AI. The other broad spectrum lists are not.
These problems have now been isolated to our IMP itself. They are
being looked into and we think that they will be corrected shortly.
In the meantime, I begin this week as I did last week. Renewing
HUMAN-NETS. Asking your indulgence as we deal with its problems.
Cheers,
Roger
------------------------------
Date: 9 June 1981 1133-EDT (Tuesday)
From: David.Nason at CMU-10A
Subject: Anyone heard of Dibol??
I am extremely interested in a language known as Dibol (?Divol?),
for which there seems to be no documentation. If anyone has any
knowledge of this language, or any documentation, please get
in touch with me. David Nason (412)421-7194, office SCH6203,
(412)578-3782.
Thanks..
------------------------------
Date: 30 Jun 1981 11:17:27-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
Subject: online legal information
DIALOG includes a database called Legal Resources Index:
"LRI covers more than 660 law journals and 5 law newspapers,
selectively indexes legal monographs and government publica-
tions from Library of Congress MArC cataloging, and includes
relevant law materials from general periodicals . . . and
significant articles from academic periodicals."
Coverage is only from 1/80 but they may start backfiling
if it catches on. For more info: Dick Kollin or Martha West,
Information Access Corporation, 404 6th Ave., Menlo Park CA
94025; or DIALOG, Lockheed Information Services, Orgn 5208
Bldg 201, Lockheed Missiles and Space Corp., 3251 Hanover St.,
Palo Alto, CA 94304. Cost is probably in the $75-100/connect-hr.
range, plus $.25 or so per printed cite. Available through
telenet and tymnet.
There's also something I've seen (at some online info cons)
called LEXIS, but I haven't picked up anything about them.
LIS or IAC might be able to give you pointers.
------------------------------
Date: 30 Jun 1981 11:22:43-EDT
From: dee at CCA-UNIX (Donald Eastlake)
Subject: JURIS in V3#114
I believe that JURIS, which is run by the Department of Justice,
is available only for government use and possibly only for
federal government use. The two big commercial law data bases
are LEXIS (run by Mead Data Systems or some such) and WESTLAW
(run by West Publishing Co). LEXIS claims to require a special
terminal and is generally much more restrictive; however, it is
the old and larger of the two.
------------------------------
Date: 1 Jul 1981 0946-EDT
From: ERIC at MIT-EECS
Subject: Computerized Legal Systems
JURIS, already mentioned in HN, developed and operated by the
Department of Justice, is probably only for government use. I
think though that it is written in SAIL and runs on tens and
twentys, so one could probably get the code, though not the data
base. Two commercially available services are: LEXIS owned and
operated by Mead Data Central Corporation allows "search through
the full text of recent cases from the federal level and from
approximately ten states". WESTLAW, a West Publishing Corporation
system, focuses its search on the West Digest system. Searching
through the digests is probably much faster/cheaper. WESTLAW
indicates they will be adding a full text search option as well.
West, by the way, seems to have a monopoly on publishing legal
textbooks. There is also a system called FLITE, at the Judge
Advocate General's office of the U.S. Air Force. Don't know
anything about it. A relatively small firm called Aspen Systems
Corporation did a lot of pretty good stuff in the early days,
but I don't know if their still around. End of Core Dump on
Legal System. Anybody up for Medical?
eric@mit-mc
------------------------------
Date: 1 Jul 1981 04:39:42-PDT
From: decvax!duke!unc!bch at Berkeley
Subject: Socialization and Computer Interaction
As a one-time sociologist I learned to take things in causal
(temporal) order. I expect that the formation of a personality
type which prefers computer to human interactions comes prior
to exposure to the possibility of computer interaction. In
a time prior to the advent of computers this type would have
become involved in reading, scholarship, inventing and other
kinds of solitary activity. If there is proof of this, it
is that there are so many hackers whose lives do not center
around computer interaction, rather network communication is
an addition to their already very social lives. Personality
is pretty well formed before reading and writing (necessities
for computer interaction) skills are learned. More to the
point, and a question I would like some response to is: How
do individuals, like ourselves, integrate our relationship
with computers to our relationships with human beings. How
do we explain who we are and what we do with these infernal
beasties to people who know nothing about them, yet play an
important part in our lives?
Byron Howes -- University of North Carolina
------------------------------
Date: 2 Jun 1981 11:12:03-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
Subject: social skills vs? computers
My suspicion, from recollections of being in the first class in
anything computerish (FORTRAN, 1969-70) at my high school, is that
most of the people who start work with computers at an early age
are the same gadget-fascinated types who take laboratory science
courses willingly (instead of complaining about such courses, like
many people I've seen even at the level of college science majors).
I can see some kids who are already outcasts turning to computers
simply because the computer doesn't care about your peck order,
taste in music, interest in studies, etc. (I recently told the
person preparing a cybernetics-in-sf bibliography that I parti-
cularly approved of Harvard's requiring all its undergraduates
to have some basic (no pun) facility with computers on the grounds
that that even for the current generation of Harvard students it
was a salutary experience to know that there are some important
things in the world which cannot be flattered, cajoled, persuaded,
bribed, coerced, or abused into a desired action.)
As one who was once such an outcast, I also question the value of
the "social skills" most of the present generation is learning/has
learned: pack/Pak ethics ("if it's different, stomp on it"); the
sanctity of pecking order; the approval of a multitude of petty and
not-so-petty dishonesties and cruelties on the threadbare excuses of
improving one's own position or the strength of one's group; and so
forth.
------------------------------
Date: 3 July 1981 1035-EDT
From: DUWARS at MIT-AI
Subject: Impact of Computers on Kiddies
Another paper people interested in research on the psychological
impacts of adolescents spending lots of time with computers should
see is Thomas Malone's Stanford PhD thesis: What Makes Things Fun
to Learn? A Study of Intrinsically Motivating Computer Games.
Excerpts from the abstract:
(1) Why are computer games so captivating?
(2) How can the features that make computer games captivating
be used to make learning -- especially learning with
computers -- interesting?
First, 3 studies are performed focusing on what makes computer
games fun ... .
The first study is a survey of the computer game preferences of
65 elementary students. There are large individual differences
in game preference, and the presence of a goal is found to be
the most important feature in determining game preference.
The second and third studies involve testing multiple versions of
specific games. The versions are isomorphic to each other except
for certain key features such as fantasy, feedback, or scorekeeping.
... The first game analyzed in this way is "Breakout", a computer
game involving sensorimotor skill. ... The most important feature
of the game is found to be the graphic display that simultaneously
presents a score and multiple level goals. Versions with no obvious
goal are significantly less appealing than the other versions.
The last study analyzes "Darts," a computer game designed to teach
fraction concepts to elementary students. A significant individual
difference is found -- in this case based on sex. Boys like the
fantasy of arrows popping balloons and dislike verbal constructive
feedback, while girls appear to dislike the fantasy of arrows
popping balloons and to like the music played in the game. Both
fantasy and music appear to be more important in the appeal of
the game than simple feedback.
The theory of intrinsically motivating instruction is organized
in 3 categories: challenge, fantasy, and curiosity. Challenge is
hypothesized to depend on goals with uncertain outcomes. Several
ways of making outcomes uncertain are discussed, ... . Fantasy
is claimed to have both cognitive and emotional advantages in
designing instructional environments. ... Curiosity is separated
into sensory and cognitive components and it is suggested that
cognitive curiosity can be aroused by making learners believe
their knowledge structures are incomplete, inconsistent, or
unparsimonious. ...
------------------------------
Date: 1 July 1981 19:25-EDT
From: Robert Elton Maas <REM at MIT-MC>
Subject: Egads! The Return of HUMAN NETS!
Subject: [Attacking public speakers]
I disagree. Just because a person publically expresses an
opinion on a controversial subject doesn't authorize others to
cast derogatory remarks about that person that are unrelated to
the person's opinions nor to the person's manner of presenting
them. What a person SHOULD accept is rebuttal to the points made
and complaints about the manner of presentation if that manner
is unsatisfactory. Thus we can complain about Pournelle at his
extreme sarcasm, complain about Schauble's very long AP/NYT
stories, and argue that debris-satellites aren't as effective
as I think they might be (see ARMS-D for that subject). Maybe
we can tease LAUREN about being a cybernaut if he has such vast
amounts of info that we have trouble reconciling that with him
being a mere human. But blanket permission to tease somebody
just because heesh got on a soapbox and expressed hir opinion
shouldn't apply here or with a real physical soapbox.
-- Rebut, don't malign. (Opinion by Robert Maas)
------------------------------
Date: 30 Jun 81 12:54:36-EDT (Tue)
From: Rivanciw.DHQ at UDel
Subject: Debugging
Yes, the story that Grace Hopper tells of the first "bug"
appears to be true. In a recent data base class I attended
the same story was told of the bug and Grace Hopper. As the
story goes, the relays in the early Mark I were rather large
switches. Since a tremendous amount of heat was generated
from the extensive electronics, the windows were quite
frequently left open to aid the cooling process.
One morning the Mark I was down. Grace made the rounds of
the electronics in an attempt to locate the problem. She
did. There under a pulsing relay was a large moth (rather
severely beaten). She "debugged" the switch and the system
was once again operational. In those days a log of the
system activity was constantly updated. In that morning's
entry Grace put in that she "debugged" the Mark I and even
taped the beaten moth to the page.
Randy
------------------------------
End of HUMAN-NETS Digest
************************
∂06-Jul-81 1041 FWH
∂04-Jul-81 1342 JMC
Is Burstall still around?
---------
Yes, I think for quite a while. His net address is Burstall%parc-maxc.
How about lunch tomorrow or soon. I just got back from two months in
Europe.
∂06-Jul-81 1148 FFL mail jmc,ffl
To: JMC, FFL
mail jmc,ffl
Hank Woodward, an attorney, wishes to speak with you about a patent.
9 326 0747
∂06-Jul-81 1421 Brian K. Reid <CSL.BKR at SU-SCORE> Re: Chronicle
Date: 5 Jul 1981 1754-PDT
From: Brian K. Reid <CSL.BKR at SU-SCORE>
Subject: Re: Chronicle
To: JMC at SU-AI
In-Reply-To: Your message of 5-Jul-81 1536-PDT
It was not I who claimed that. I assume that you refer to
the discussion in Human-Nets. The Newspaper Preservation Act of (I think)
1968 permits such combinations as the Examiner/Chronicle. I vaguely
recall that it was Brian McCune who posted that correction to Human-Nets.
-------
∂06-Jul-81 1423 Burstall at PARC-MAXC Re:
Date: 6 Jul 1981 14:20 PDT
From: Burstall at PARC-MAXC
Subject: Re:
In-reply-to: Your message of 06 Jul 1981 1339-PDT
To: John McCarthy <JMC at SU-AI>
cc: burstall
John, It will be very good to see you. But for once I seem to be very much
booked up for lunch. Would Monday (13th) be any good or Tuesday (14th)? If
not maybe I can cancel my lunch date this Wednesday (8th) and have it with
you. Come to you office at 12 or eat out someplace?
I am going to Britain and Germany for a few weeks on the 15th. Not so easy to
get on the same continent with you.
Rod
How about Monday the 13th at the Little Hsi Nan on University and Emerson
at noon? It is the generally favored Chinese place.
∂06-Jul-81 1645 ADMIN.GORIN at SU-SCORE (Ralph Gorin) Your tapes
Date: 6 Jul 1981 1458-PDT
From: ADMIN.GORIN at SU-SCORE (Ralph Gorin)
Subject: Your tapes
To: jmc at SU-AI
cc: admin.mrc at SU-SCORE
I've restored the files from these tapes as best I could.
LOGLISP now resides on the subdirectories of MRC:<LOGLSP>
PROLOG resides in MRC:<PROLOG>.
The device name MRC: refers to a mountable structure that's usually
present. Mark will assist you in obtaining access to those files.
I was unable to restore the core image file PLC.EXE, part of prolog.
Also, the document file PROLOG.DOC is somewhat damaged. Both problems
are due to unrecoverable tape errors.
Ralph
-------
∂06-Jul-81 2127 OTA
To: JMC
CC: TAW, OTA
[John, The fix we made (to our copy) was simply to remove the two words
that looked like the start of an unfished sentence. We sent that version
in so it will not be easy to do anything else at this point now. Try
searching for "You should" in SPACE.TEX[W81,JMC], if you want to see what
it looked like, and CACJMC.TEX[1,OTA] to see what was sent in.
Ted Anderson]
∂04-Jul-81 1355 JMC
If you are still editing my paper, I'll be glad to look at what you have.
∂07-Jul-81 0844 FFL
To: JMC, FFL
A Chinese girl called saying she was a friend of a Chinese friend of yours.
She is bringing greetings and a token from your friend and wants to come in
about 1:30 Wednesday to speak with you a few minutes. Will you be available?
She will be calling me to check on the appointment.
I'll be here tomorrow to meet the Chinese girl.
∂07-Jul-81 2057 Oded Anoaf Feingold <OAF at MIT-MC> energy digest
Date: 7 July 1981 23:51-EDT
From: Oded Anoaf Feingold <OAF at MIT-MC>
Subject: energy digest
To: ENERGY
(Critique of (Lovins' critique of (nuclear power industry)))
a quote
(Critique of (Lovins' critique of (nuclear power industry)))
an original
----------------------------------------------------------------------
ES@MIT-MC 07/05/81 20:49:31 Re: Government-guaranteed knowns
To: ENERGY at MIT-MC
From "Access to Energy", April 1981, by Petr Beckmann, without permission.
If energy genius Lovins were to give the auto industry the same advice
he is giving the utilities, he would tell them to stop making cars and lend
motorists the saved money to buy bicycles.
Both industries are sliding downhill; and the utilities are sliding
faster. True, Detroit had to design cars to specifications made in Washington,
but at least they were allowed to charge with the bill for Ralph Nader's
concoctions. The utilities, however, have not only been under the equally
loving care of Gus Speth & Co; they have their whole business run by
politicized Public Utility Commissions plus a host of bureaucrats and
ideologues with one common trait: They spend other people's money.
Prevented from raising their rates in time to cover rising expenses,
unable to raise money for new generating capacity or sometimes even for
finishing what is under construction, harassed by obstructionist demagogues,
and scared of their own shadows, the semi-nationalized utilities may
eventually have to face complete nationalization; and the bitter irony of it
is that this odious option may yet confront none other than President Reagan.
The way to avoid this specter is not bail-outs, subsidies or
guaranteed loans. What is needed is not just to "let the free market work,"
but to guarantee, under pain of damages to the victims, that it can work.
Example: Most students of nuclear fuel reprocessing believe that it is
not only economic, necessary, and inevitable, but also, in a genuinely free
market, sufficiently profitable to attract thousands of investors -- the type
who bought IBM or Texas Instruments shares when nobody had heard of them.
Yet in reality there is not a nitwit in the country who would risk a
cent for such a venture; not because it is unsound, but because four or
eight years hence the voters' whim might elect another grinning dunce who
could dismantle everything again for reasons of political expediency.
What government should give industry is not government-guaranteed loans,
but government-guaranteed damages in case it changes the rules; it would then
soon be clear what is profitable and what isn't, for it would be made plain
by the ultimate experts -- those who make the profit.
The government, for its part, could save the funds and gain the esteem
it needs for doing its proper job -- protecting the citizen's freedoms.
Budget Boss Stockman reportedly says "If it is economic, industry will
support it" as his axe slows (not checks) budget growth.
He is almost right. Congress should be prodded to make him absolutely
right.
------------------------------
Date: 3 Jul 1981 1500-PDT
From: ICL.REDFORD at SU-SCORE
Subject: nuclear power article
To: energy at MIT-MC
cc: ICL.REDFORD at SU-SCORE
A couple of the points made in part ten of the series seem odd to me:
1) Nuclear power protest has been "chilled" by the efforts of the
nuclear industry. One can only wonder what the protests would be like
otherwise. Demonstrations involving thousands of people, active
occupation of several sites, anti-nuclear initiatives on the ballots of
a number of states, and constant media attention would seem to indicate
that the protest movement is alive and kicking. Nuclear power has
been the biggest protest issue since the Viet Nam war. No doubt
the industry would like to get rid of some of their opposition, but if
they've tried they've been pretty ineffectual.
2) Proliferation can be slowed by doing away with nuclear power.
This is probably true, but it's worth noting that
of the six nations known to have the Bomb (and I mean really known, not
"well of course South Africa's got it" type rumors), only one got it via
a power program. Selling nuclear technology to nations hungry for the
Big One is clearly a bad idea, but that's only a small part of the question
of arms control, which I consider infinitely important than the
question of reactor safety.
3) Lovins' point that it's bad to have something as fundamental as
energy in the control of a "distant technological elite". Well frankly
I don't care where my electricity comes from. I, and probably most
people, would rather not have to worry about it. I don't care how my
groceries get to the supermarket, or how my telephone is connected,
or where my water comes from, or where my sewage goes. So long as these
things are done efficiently and safely there is no reason for
me to waste my time working on them. If soft energy means getting up at
two o'clock in the morning to fix the roof windmill then it's not going
to catch on.
-------
end of energy digest
********************
Congratulations on your point 3 about preferring not to get up to
fix the windmill.
∂08-Jul-81 1002 JK arpa visit
My wife says that we have managed to prepay for our motel for
our vacation, so canceling for July 28 might cause some problems.
Are the chances of doing anything July 29 indeed nil?
∂08-Jul-81 1214 CLT blindrobot
Is the puzzle stated somewhere in the literature? do you know a particular
reference?
The blind robot puzzle is due to Donald Michie. As I remember it, the robot
was initially not supposed to be blind, and it was to be a more typical
AI problem. It's just that Michie or someone else noticed that it could
be solved even by a blind robot. My suggestion is either to call or
write Michie (possibly at U. Illinois or Edinburgh), ask Harry
Barrow at Fairchild (who probably was in Edinburgh at that time), or
look in my files or the library for a Michie memo.
∂08-Jul-81 1429 CG
The address of the publisher of "outstanding dissertations in computer
science" is:
Garland Publishing, Inc
136 Madison Ave.
New York, New York 10016 tel: 212 - 935 - 1571
∂08-Jul-81 1552 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Comp. Programming Project
Date: 8 Jul 1981 1548-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Comp. Programming Project
To: JMC at SU-AI
Danny Berlin's comprehensive programming project needs to be graded.
The Committee has promised a 10-day turnaround. Since it is in the
AI area, I would appreciate your grading it. Danny will be leaving
on July 25 and needs to know if anything else is required before he
leaves. He has to pass it this summer.
May I deliver it to you?
Carolyn
-------
No. I have several papers to write before then, and I haven't
scheduled the time.
∂08-Jul-81 1658 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Help?
Date: 8 Jul 1981 1656-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Help?
To: JMC at SU-AI
John, I asked Ken Clarkson to grade it, but since he hasn't passed yet,
he feels it improper. Terry won't return until July 15. Could you
possibly look it over to see if it will require anymore work by Danny?
I'm stumped!
Carolyn
-------
∂08-Jul-81 1727 Konolige at SRI-AI tomorrow
Date: 8 Jul 1981 1728-PDT
From: Konolige at SRI-AI
Subject: tomorrow
To: jmc at SAIL
John, Mark Stickel is talking tomorrow (Thursday) at 10am about
theorem-proving, and Stan, Nils and I would like to sit in on that. If
you could arrive here at 9:30 instead of 10, we would have time to sit
down and talk before then. Please send me a message to let me know if
this is convenient. --kk
-------
∂09-Jul-81 0830 FFL
To: JMC, FFL
Dr. Minker of the U. of Maryland called and would like you to call him
back. 301 454 4251
∂09-Jul-81 1328 FFL
To: JMC, FFL
Please call the NY office of SE2. They wish to confirm arrangements for
your trip to San Clemente on Saturday. 212 840 6595. You should ask for
Mimi Scrandis. Pls. call before 5 if possible.
∂09-Jul-81 1404 FFL
To: JMC, FFL
Dr. Lederberg stopped by, with Prof. Feigenbaum, to say hello.
∂09-Jul-81 1848 BYY reply
To: JMC
CC: BYY
Barwise now in Wisconsin. John Perry here.
∂09-Jul-81 1851 BYY reply
To: JMC
CC: BYY
fantastic. have learned basic, working on lisp. (and a little on
adventure). JP
∂09-Jul-81 1939 Burstall at PARC-MAXC Re:
Date: 9 Jul 1981 19:38 PDT
From: Burstall at PARC-MAXC
Subject: Re:
In-reply-to: Your message of 06 Jul 1981 1445-PDT
To: John McCarthy <JMC at SU-AI>
Sounds good, Monday at noon.
∂10-Jul-81 1051 FFL
To: JMC, FFL
Dr. Jack Minke of U. of Maryland called to say that Alexander Learner's wife
has died. He asks if you will sign the following telegram to go to Ambassador
Dobrynin today: "We have been shocked to learn of the death of Judith
Learner, wife of the renown cyberneticist, Alexander Learner. The Learner
family has suffered enough. It is now time to give Dr. Learner and his son
an exit visa."
Please call Dr. Minker's office today if you wish to sign. 301 454 4251.
∂10-Jul-81 2127 Feigenbaum at SUMEX-AIM IJCAI draft program
Date: 10 Jul 1981 2122-PDT
From: Feigenbaum at SUMEX-AIM
Subject: IJCAI draft program
To: jmc at SU-AI
cc: csd.jake at SU-SCORE, csd.jfeigenbaum at SU-SCORE
John, I personally dont have a copy. My daughter Janet who has been doing
the TEXing of the program for IJCAI might have a copy around. If she does,
I hereby ask her to give it to Jake for xeroxing and delivery to you.
Ed
-------
∂11-Jul-81 1831 Robert Elton Maas <REM at MIT-MC> Research anouncement follow-up
Date: 11 July 1981 21:33-EDT
From: Robert Elton Maas <REM at MIT-MC>
Sender: ←←←113 at MIT-MC
Subject: Research anouncement follow-up
To: INFO-GO at MIT-MC, JMC at SU-AI, LES at SU-AI, ALS at SU-AI,
WESTCOTT at BBNC
cc: RWG at MIT-MC, FFM at MIT-MC
≥≥1981.JUL.11 1757 PDT -- I've been working for several days,
emulating by hand the latest version of my Go endgame
algorithm, with the new pruning method of a few days ago. I've
now finished the skirmish I was analyzing, an instance of the
monkey jump (see diagram below). The result is that this monkey
jump is gote (i.e. not sente on either side) with T=4+7/12
under human/Japanese scoring (T=5+7/12 under computer scoring),
i.e. if a move is worth more than 4+7/12 points elsewhere then
neither player will move (make the monkey jump, or defend
against it), while if the biggest move elsewhere is worth
slightly less than 4+7/12 then whoever's turn it is will make
one move and the other player will ignore it and play
elsewhere. With a score of +6 (black minus white) for the best
black can do moving first and alternately, and a score of +2
for the lowest score that white can shave things down to by
moving first and alternately, the complete score-function is
BLACK=(6 MIN 8+5/6-T MAX 4+1/12) and WHITE=(2 MAX -1/2+T MIN
4+1/12). Here's the diagram (white makes monkey jump or black
defends; 9*9 board assumed here):
4 - - - - - X O - - 4
3 X X X X X X O - - 3
2 - - - - - - O - - 2
1 - - - - - - - - - 1
A B C D E F G H J
Monkey jump is D1, defense is F2.
The monkey jump is a moderately tricky situation. I spent 60
diagrams analyzing all the moves and threats and
counter-threats needed to guarantee the result is correct. The
gist of this message is that my algorithm works and should be
programmed, at which point we'll have a computer that can play
the endgame of Go better than professional Go players. Anybody
have any good suggestions for publishing or programming? (I
can't do it myself without funding; I figure it will take a
couple man-years to write all the support programming such as
the isolated-skirmish best-move-finder. I can't afford to
invest that time myself without a R&D grant or other funding.)
∂12-Jul-81 1806 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #5
Date: 12 JUL 1981 1227-EDT
From: DUFFEY at MIT-ML (Roger D. Duffey, II)
Subject: HUMAN-NETS Digest V4 #5
To: HUMAN-NETS at MIT-AI
HUMAN-NETS Digest Sunday, 12 July 1981 Volume 4 : Issue 5
Today's Topics:
Query Reply - Hacker Stories,
Computers and People - Third Wave Effects,
Telephone System - Syntactic Area Codes, Humor - Debugging VII
----------------------------------------------------------------------
Date: 10 July 1981 22:36 edt
From: SSteinberg.SoftArts at MIT-Multics (Seth A. Steinberg)
Subject: burnt out hackers stories
At the School of Beaux Artes around the turn of the century
students would work all night to get their projects finished
before the cart came around to collect them. The word for
cart is charrette and to this day pulling an all-nighter is
referred to as charretting. The architectural supply firm
took its name from this term.
If you want a computer related story perhaps an interview
with Ted Anderson at LLL would let him describe his LISP
program to optimize burnout. You type in your maximum
and minimum sleep times, the number of hours you need to
average every 24, your max and min working hours and at
what times you have to be awake to interface with other
people at meetings. The program gives you a schedule for
the week. I think you can reach him as OTA at MIT-MC.
------------------------------
Date: 9 Jul 1981 1343-PDT
From: Gaschnig at SRI-AI
Subject: captivating features of computer games
Subject: applied to aid learning
In V4 #1, DUWARS@MIT-AI discussed studies of why computer games
are fun and how that fun can be captured in educational programs.
The 1981 West Coast Computer Faire had a booth illustrating this
approach. The objective was to learn typing skills by doing
exercises. The user has a base in the center of the screen that
he/she is supposed to protect from invading monsters. The monster
can come from the top, bottom, right, or left side of the screen.
In each quarter of the screen there is a magic weapon: a letter,
or two-letter sequence, or 3 or 4, etc. When the monster appears,
the user types the sequence corresponding to that quarter. If
the sequence is typed correctly and in time, the monster is
killed, else the user is. Each iteration scores one point for
the monster or the user. The letter sequences are changed with
each iteration, and get progressively longer or harder or have
to be done faster. The people I observed trying the system
seemed to get engrossed in it and forget that they were really
supposed to be learning how to type.
Another example is the "fly swatter" program on Xerox Altos,
Dorados, (and Star too I think) to teach people how to use
the mouse for pointing. A fly starts buzzing around the
screen, and you have to move the mouse to touch the fly and
press the swat button. The icons look like a fly and a fly
swatter. The more flies you kill the faster the fly and the
more evasive they get. Before you know it, you're good enough
at it to use the editor and other mouse-loving programs.
John Gaschnig
------------------------------
Date: Thursday, 9 July 1981 18:10-EDT
From: Jonathan Alan Solomon <JSOL at RUTGERS>
Subject: Using area codes as prefixes in phone numbers
New York is currently doing just that. The whole reason for
requiring it's customers to dial 1 is so they could use the
area codes as prefixes. In fact they announced it, and one
month later switched over to it. A week after that the first
one was used (I don't remember the number exactly)...
I think the only other place where this is going on is Los
Angeles, CA (213 area code), but it seems to be a trend which
the Phone Co is starting.
Jsol
p.s. next we will have 25-digit phone numbers!
------------------------------
Date: 8 Jul 1981 09:53 PDT
From: Deutsch at PARC-MAXC
Subject: Syntactic area codes
The Los Angeles area has had exchanges like 412 and 705 for
several years now. Most metropolitan areas that I've visited
require a '1' before long distance dialing. I've wondered
what Ma Bell will do when she runs out of the area code space
for exchanges -- split a single area into two? Have a set of
exchanges that use 5 digits instead of 4, or 4-digit exchanges?
The mind boggles.
------------------------------
Date: 9 Jul 1981 1408-PDT (Thursday)
From: Lauren at UCLA-SECURITY (Lauren Weinstein)
Subject: NPA's vs. prefixes
Since the beginning of the DDD (Direct Distance Dialing) network,
the standard format for a Numbering Plan Area (NPA ==> Area Code)
has been:
N 0/1 X where:
N = 2-9 and X = 0-9
This creates 8*2*10 possibilities, of which 8 (211, 311, ... 911)
are reserved as local service codes. This leaves 152.
As for local central office codes (prefixes), there were
originally two types to deal with:
2L-5N numbering: where the first two characters are the first
two letters of the central office name, and the third through
seventh characters are ordinary numbers with no special
significance.
ANC: All number calling (digit dialing). These are the standard
7 digit numbers with no special linkage to central office NAMES.
Conversions from 2L-5N began around 1961, and at this time few
of the older type remain. There was considerable public anxiety
about ANC when it was first introduced.
Now, if we permit limited INTERCHANGEABILITY between NPA and
central office codes, we end up with a NXX type sequence (where
N and X are defined as above.) This permits for a theoretical
maximum of 792 central office codes (800 minus the eight N11
combinations mentioned above). Of the 800 NXX combinations,
approx. 202 codes are reserved for use as area codes, special
service codes, and other uses. These include:
Area Codes N 0/1 X (conventional area code) 152
Area Codes NXX (new style area codes) 27
Area Codes
or
Future Services 950-954, 975-979 10
Plant 958, 959 2
Time 844 (internal code) 1
Weather 936 (internal code) 1
Toll Info 555 1
LD operator 211 1
Info 411 1
Repair 611 1
Business O. 811 (planned) 1
Special 311, 511, 711, 911 (emerg.) 4
-----
202
What this all amounts to is that there are two separate problems:
1) Running out of NPA's (area codes)
2) Running out of local office codes
In order to solve these problems, it has become necessary
to break the old N 0/1 X rule for assigning area codes, and
allow pretty much full interchangeability. While some of
the numbers listed above vary between locales, the overall
numbering situation is the same across the DDD net, as you
can well imagine. The only way to differentiate between
area codes and office codes, given that they have the same
format, involves use of 1 or 0 + dialing. This is not as
simple as might be thought at first, since in many areas
1+ calls include TOLL calls within the area code, as WELL
as long distance calls OUTSIDE the area code. So you cannot
depend on an initial 1 (for station calls) or 0 (for assisted
calls) to differentiate. For this reason, the equipment is
designed to delay processing a call after the 7th (8th) digit
is dialed, for three to five seconds, to see if any additional
digits will be forthcoming. If there are more, it knows it
should treat the first three significant numbers as an area
code, or try to anyway. This delay procedure does not take
place in areas that only use 1+ for long distance calls (like
Los Angeles).
A similar sort of arrangement is used on IDDD (International
Direct Distance Dialing) calls, where 011 is the standard
access code. In this case, the system delays completing a
call to Operator (0) for three to five seconds in case more
digits are forthcoming. This also applies to EDDD (Extended
Direct Distance Dialing) calls, where you dial 0+10 digits
and THEN get an assistance operator.
Most of these facilities are part of the TSPS (Traffic Service
Position System) network, which acts as a higher order link
point for many local offices in a region.
Back to area codes. When the original numbering plan was
devised around 1947, it was already fully understood that the
initial plan would run out of numbers by the early 1970's. So
contingency plans were made which even included the ORDER in
which central office codes would be used as area codes... for
example:
260, 480, ...
There are similar plans for assigning old style area code
numbers as local prefixes, with all sorts of rules for
avoiding unreasonable conflicts.
Unfortunately, in some locales, the situation is already so
complex that more drastic measures are necessary. Such in
the case here in Southern California, where 1+ dialing for
long distance has been in use for several years. According
to my sources, sometime in late 1985 or early 1986, the 213
area code will be SPLIT in two, right down the Hollywood
Hills. This will mean that the entire San Fernando Valley
will have its own area code -- probably 818. A little bit
earlier, the largish 714 area code, which includes Orange
County and much of the rest of Southern California except
for L.A., will change its code, probably to 619 -- EXCEPT
for Orange County, which will remain 714 all by itself.
Things will be happening in Northern California as well.
Up in 415/408 land, the protected office codes will be
discontinued. This means that it will no longer be
possible to reach certain prefixes as 7 digit calls
from BOTH 415 and 408, as currently exists. This change
will take place fairly soon.
Note that officially, none of these numbering changes will
affect rates. If a call was local before, it will remain
local even if you DIAL it as a 1 + 10 Digit call. Of course,
by 1985, we will all probably be paying by the minute for
ALL calls, so the concept of local will be down the drain
completely.
Remember quite some time back I discussed the dialing area
reductions that were going to take place in California as the
second phase of the ZUM (ZOOOOOOM!) plan? Well, Pacific and
General Telephone have now made official notification of the
changes to customers, and the schedule matches exactly with
my original information. So if your area was included in my
original timetable, you may rest assured that my predictions
on this subject will (sadly) come to pass, though your noti-
fications could come later depending on implementation dates
in your area.
By the way:
I think there is work currently going on at Bell Labs on
IGDDD (Inter-Galactic Direct Distance Dialing), but I am
not at liberty to discuss it at this time.
--Lauren--
------------------------------
Date: 4 Jul 1981 1759-EDT
From: MOOERS at BBNA
Subject: "Bugs" and their history
I can't recall when the term "debugging" came into use, but
the use of the word "bug" to mean an error in an electronic
circuit was established long before there were computers.
I remember first hearing it during World War II, and I don't
think it was new then.
The word eventually made its way across the Atlantic to
England, where it caused considerable alarm and despondency,
since the word "bug" means specifically "bedbug" in England,
and seems to be a rather vulgar term, as well.
---Charlotte Mooers
------------------------------
End of HUMAN-NETS Digest
************************
∂13-Jul-81 1036 Jake Brown <CSD.JAKE at SU-SCORE> copy of IJCAI program
Date: 13 Jul 1981 1036-PDT
From: Jake Brown <CSD.JAKE at SU-SCORE>
Stanford-Phone: (415) 497-9798
Subject: copy of IJCAI program
To: jmc at SU-AI
Janet, Ed's daughter, is going to give me a copy today. I'll put it in your
box when I get it.
Jake
-------
∂13-Jul-81 1152 Nilsson at SRI-AI Prolog
Date: 13 Jul 1981 1153-PDT
From: Nilsson at SRI-AI
Subject: Prolog
To: JMC at SU-AI
Mail-from: ARPAnet host SRI-KL rcvd at 12-Jul-81 2203-PDT
Date: 12 Jul 1981 2205-PDT
From: Barrow at SRI-KL
Subject: Prolog is up on the 20-60
To: AIC-Staff:
cc: Barrow
I have been using the latest issue of Prolog and, finding it a
delightful language, thought that you might like to experiment with it
too. This version of Prolog seems to be comparable in speed to LISP
1.6 (both interpreted or both compiled), and lends itself to elegant
code. Its disadvantage, however, is that the only numbers it
understands are 18-bit integers!
My copy was obtained from Jim Kajiya at CalTech, on the understanding
that I write to Dave Warren seeking retrospective permission. I have
also placed a copy on the 20-60, on the directory <PROLOG>, subject to
Dave's permission being forthcoming.
To run the system, run <PROLOG>PROLOG.EXE . It contains both an
interpreter and a compiler for the language.
But first, read some of the other files:
PROLOG.DOC The manual.
GUIDE3.MEM Update of the manual for the current version
(Major improvement is that the compiler is
core-resident, not an extra program).
DEBUG.MEM Documentation for the debug facilities
(A nice trace/stepper package).
For a basic introduction to Prolog, read TUTORI.LPT, which also
has copies of its examples on TUTORI.PL so you can try them out.
I encourage you to try Prolog. I found it easy to learn, use,
and debug. I think you will like it.
Harry.
-------
-------
∂13-Jul-81 1312 BLEDSOE at SRI-AI s and t problem
Date: 13 Jul 1981 1311-PDT
From: BLEDSOE at SRI-AI
Subject: s and t problem
To: jmc at SU-AI
cc: bledsoe at SRI-AI
John, I left my copy of the s and t problem at home. Do you have a copy that
you could send to me here? BLEDSOE@SRI THANKS, Woody
-------
Two numbers m and n are chosen such that 2 lesseq m lesseq n lesseq 99.
Mr. P is told the product, and Mr. S is told the sum. The following
dialog occurs:
Mr. P - I don't know the numbers.
Mr. S - I knew you didn't know them. I don't know them either.
Mr. P - Now I know them.
Mr. S - Now I know them.
What are the numbers?
∂14-Jul-81 0735 Navarro at SRI-AI DEDUCTION MONTH NEWS
Date: 14 Jul 1981 0736-PDT
From: Navarro at SRI-AI
Subject: DEDUCTION MONTH NEWS
To: jmc at SU-AI
DEDUCTION MONTH NEWS
Wednesday, July 15: Bob Moore "Deduction for Commonsense Reasoning
and Natural Language Processing"
L369 10:00 am (sharp!)
Friday, July 17: Richard Waldinger "Synthesis via Deduction"
L369 10:00 am (sharp!)
Next Week: to be announced
Possibilities: Stan Rosenschein "Planning via Deduction"
Lotfi Zadeh "Fuzzy Deduction"
Others ?
Meetings next week will probably be on Tues. 21 and Wed. 22 at 10:00 am.
(sharp!)
--Nils
-------
-------
∂14-Jul-81 1322 FFL
To: JMC, FFL
Mr. Sosna of Universal Pictures in L.A. called. Understands you may have
some films from early days of AI. Would like to speak with you about
historical research in that area. Call collect 213 508 3l28.
∂14-Jul-81 1336 FFL
To: JMC, FFL
John Burge called to say kthat they have received funding from NSF for the
workshop on Logic Programming from Intelligent Systems. Would like to talk
with you about presenting a paper. August 19-2l on the Queen Mary.
213 887 4950.
∂15-Jul-81 0039 CSD.MALIK at SU-SCORE meeting
Date: 15 Jul 1981 0035-PDT
From: CSD.MALIK at SU-SCORE
Subject: meeting
To: jmc at SU-AI
I just read your message about meeting you -too late.I would like
to know if this meeting could wait till the weekend as due to ssome
reason I was planning to be out of town for the next 2-3 days.I am sorry
about this but if it is important I could cancel my plans.As such I am planning
to be in Stanford the rest of the summer.Please let me know my sending mail
at csd.malik.I }am logged in awaiting your message.
Jitendra Malik
-------
The weekend will be ok. Call me when you return at home if necessary.
∂15-Jul-81 0900 JMC*
Waltuch about ear
∂15-Jul-81 1157 FFL
To: JMC, FFL
Please call Les Dugan at 55 495 5669.
∂15-Jul-81 1605 Nilsson at SRI-AI Agreement
Date: 15 Jul 1981 1607-PDT
From: Nilsson at SRI-AI
Subject: Agreement
To: JMC at SU-AI
cc: Nilsson
John, You were going to send a signed copy of the agreement letter
Bonnie and I sent you regarding reprinting some of your papers in
our edited volume. You didn't like the part about exclusive rights
and were going to strike that part out--that's fine with us. May
we assume that, with that alteration, we have your permission to go
ahead and that the signed letter will be forthcoming? Thanks, --Nils
-------
Yes, without exclusive rights, it's fine as I remember it.
∂15-Jul-81 1630 FFL
To: JMC, FFL
Mr. Sosna of Universal Pictures in L.A. called again. He is VERY ANXIOUS
to speak with you. He asks that you call him collect 213 508 3l28 (office)
or if you wish to call him collect at his home this eevening, 213 501 6623.
Maybe you will be a star in another Star Wars!
∂15-Jul-81 1638 FFL Date of meeting with Machado
To: JMC, FFL
Dick Gabriel says that people at SRI think that Machado is going to be with
them on the 28th. I will check oon this in the morning with Gio's secretary.
She has gone just now.
∂15-Jul-81 1639 FFL
To: JMC, FFL
Harry Llull of Mah-Sci Libe would like to speak with you re some program in
which he thinks you expressed on interest. 7-0864 or 7-4672.
∂15-Jul-81 1641 FFL
To: JMC, FFL
Do you want me to make a reservation for you for the salmon barbecue on
Wednesday, August 26, at the IJCAI conference? They ask for an answer on
the conference registration form.
Yes, please. I like salmon.
∂15-Jul-81 2249 Wiederhold at SRI-AI Visit
Date: 15 Jul 1981 2250-PDT
From: Wiederhold at SRI-AI
Subject: Visit
To: Principals:, Participants:
John Machado has confirmed visit and schedule for July 27 and 28:
From: Wiederhold at SRI-AI
Subject: schedule for visit by Machado nvalex-arpa
To: jmc at SAIL, tob at SAIL, dcl at SAIL, zm at SAIL,
To: wiederhold at SUMEX-AIM
cc: csd.betty at SCORE, pickering at SUMEX-AIM, kaplan,
cc: sagalowicz, rowe, ark at SAIL, des at SAIL, navathe,
cc: jed at SAIL, csd.whang at SCORE, polak at SAIL,
cc: henke at SAIL
To: jmc@SAIL, tob@SAIL, dcl@SAIL, zm@SAIL, wiederhold
cc: mas@SAIL, kaplan@SRI-KL, sagalowicz@SRI-KL,
cc: csd.betty@SCORE
!
Provisional Schedule
for John Machado, Navelex project officer for KBMS
and for other consolidated ARPA contracts Oct.81-Sept.83.
Stanford July 27th - 28
Monday July 27th 1981 8:30 to noon
"KBMS, Management of Distributed Knowledge "
Principals Wiederhold, Kaplan, Sagalowicz
Participants Davidson, Whang, Navathe, Shaw,
(if again operational : Beetem )
(absent to Aug. 3: Rowe, Keller)
Lunch noon:1pm
Monday July 27th 1:30pm to 5:00
"Analysis and Verification of High Order Language Programs"
Principal David Luckham ( subject to being at Stanford,
expects to return Aug. 1 )
Participants Polak, von Henke, Germani
Larsen, Stevenson, Treitel, Osher, and Finlayson
Tuesday July 28th 8:30 to noon
"Basic Research in Artificial Intelligence and Formal Reasoning"
Principal John McCarthy
Participants Creary, Doyle, Goad, Ketonen, Gabriel, Tolcott
Lunch open
Tuesday July 28th 1:30 pm to 4:00
"Image Understanding"
Principals Binford, McCarthy
Participants Liebes
(Zohar Manna : will be out of town until Aug. 9, no response yet)
"A System for Deductive Programming"
Principal Manna
Participants Wolper, Malachi
-------
∂16-Jul-81 1018 FFL
To: JMC, FFL
John Perry from CASBS stopped by to see you.
∂16-Jul-81 1139 FFL
To: JMC, FFL
Mr. Sosna from Universal Pictures called again. He pleads that you call
him. 213 508 3l28.
∂16-Jul-81 1344 FFL
To: JMC, FFL
Mary Clark from Bechtel Ctr. called to ask if you had looked at papers and
were interested in a man named Dacar from Yugoslavia as a visitor this
next year. He comes sponsored by some exchange organization. She said she
had sent his papers to Weyhrauch and that Richard told her that he had given
the papers to you. This was along in March, she said. I do not recall or
find any papers for Dacar. Are you interested in pursuing the matter?
Mary Clark says she need to give the exchange an answer today.
∂16-Jul-81 1442 TOB
John
I applied to the faculty club and was turned down. Would you sign
a letter in support of my membership?
Tom
Dear
I write to support Dr. Binford's petition for membership in the faculty club.
Dr. Binford, who has been at Stanford since 1970, is the leader of the Computer
Science Department's large research program in
computer vision and industrial automation. He has been recommended
by the Computer Science Department for promotion to the rank of Adjunct
Professor. He is in every way the kind of person who should be a member
of the Faculty Club.
Moreover, his use
of faculty club facilities would benefit our joint research program.
Sincerely,
Fran: Please make a letter for my signature to whoever is in charge of
faculty club membership.
∂16-Jul-81 1512 VRP via Ethernet host 50#300 concurrency verification problem
To: "@SEM.DIS[SEM,VER]" at SU-AI
In the course of porting Unix to the 68000 I wrote a simple storage allocator
for allocating and returning fixed size blocks. (The sort of thing that
normally is implemented merely by chaining together all the free blocks.)
Since this allocator is shared by concurrent processes the need for mutual
exclusion arises. I decided that semaphore-based mutual exclusion was going
to be too expensive, as well as a potential source of deadlocks, and
came up with a method of allocating and returning blocks that requires no
mutual exclusion (i.e. single-instruction atomicity suffices). The method
is quite simple, half-a-dozen lines of C code for each of alloc and free.
However I am not entirely convinced of the correctness of the method. While
I'd just love to settle down and prove it correct or find the counterexample
myself, the port is more urgent for me right now. Nevertheless it is
important for the port to know whether this algorithm is correct. (An
earlier, incorrect, version wasted several days while I tried to track down
a mysterious bug that crashed the system every few hours, eventually traced
to the defective algorithm. It now runs fine if left to run for a week, but
I'd like to rule it out as a suspect if we start observing mysterious
monthly bugs.)
If you would like to have a shot at this problem I'd be most grateful for
the help. Experience with proving concurrent algorithms correct helpful,
brains a good substitute for experience here.
∂16-Jul-81 1805 TOB thanks
John:
Thanks for your letter to the faculty club.
Tom
∂16-Jul-81 2100 JMC*
Waltuch
∂17-Jul-81 0818 Navarro at SRI-AI More Deduction News from Nils
Date: 17 Jul 1981 0818-PDT
From: Navarro at SRI-AI
Subject: More Deduction News from Nils
To: AIC-Staff:
cc: JMC at SU-AI, jd at SU-AI
DEDUCTION MONTH NEWS
On Wed. July 22 at nearly 10:00 am in the AIC conference room (K242),
Lotfi Zadeh will speak on deduction in fuzzy logic. This may well be
the last talk during deduction month there are other volunteers.
Lotfi's abstract follows:
DEDUCTION IN FUZZY LOGIC
L. A. Zadeh
ABSTRACT
Deduction in fuzzy logic is, for the most part, approximate rather
than exact. For this reason, the chains of inference are usually short
in length.
Some very simple examples of deduction are:
(a) most Swedes are tall
--------------------------------
most x most Swedes are very tall
where most is a fuzzy proportion and x is the product of fuzzy
----
numbers
(b) Mary is young is very true
--------------------------
Mary is very young
(c) Mary is young is likely
-------------------------------------
Mary is very young is likely x likely
Mary is not young is unlikely
where unlikely is the antonym of likely, and likely is a fuzzy
number.
Deduction in fuzzy logic reduces, in general, to the solution of a
nonlinear program. Although fuzzy logic is more general than classical
logic, it is close to intuition and is relatively easy to learn.
-------
∂17-Jul-81 0909 FFL
To: JMC, FFL
Please call Hank Woodward. 326 0747
∂17-Jul-81 1330 BYY appt
To: JMC
CC: BYY
can i stop in an see you anytime this afternoon?john perry
∂18-Jul-81 0900 JMC*
savitt
∂18-Jul-81 0900 JMC*
weening+bloom
∂18-Jul-81 1427 Oded Anoaf Feingold <OAF at MIT-MC>
Date: 18 July 1981 17:27-EDT
From: Oded Anoaf Feingold <OAF at MIT-MC>
To: jmc at SU-AI
Did you know any Japanese back in 1959-60? I'm studying
it now, and it seems very lispish.
No. I didn't study any Japanese till after my first visit in 1969.
∂18-Jul-81 1434 LLW Phoning
To: JMC
CC: LLW
∂15-Jul-81 0100 JMC
When's a good time to phone?
[John: Essentially any evening--I'm usually reliably around from 2100 to
at least 0200. Lowell]
∂19-Jul-81 2135 LGC Appt. Monday?
I'd like to discuss a couple of things (including my NSF proposal) with you
soon; would 5pm tomorrow be ok? -- Lew
∂20-Jul-81 0535 JRA thanks
john,
thank you for coming to our lisp session. the week was pretty crazy: 5am-12pm
every day. a few of the participants didn't seem to appreciate the
effort, complaining that we spent too much time lecturing and not enough
"hacking". six hours lecture & four hours a day hacking problems doesn't
seem an improper balance to me (in a course that is supposed to be graduate
level).
i'm finally recovered enough to respond to your note:
∂03-Jul-81 1323 JMC inquiries about LISP
I often get inquiries about LISPs for various machines. If there is
any way you think you can make money out of it, I would be glad to
refer them to you. I send one as a sample, but you needn't answer
it.
i am interested in talking with people about lisp for various machines.
(unfortunately, it doesn't pay well if at all). i do recall your sample:
it was with regard to lisp on an hp-3000. i don't know of an implementation;
my tenure with hp was not a happy one. 2-1/2 years of trying to get them to
do the right thing lead to my bitter exodus, only to have them say "gee, i
guess he was right" and proceed to by dec-20's and ai people.
... with regard to making money (which my company is NOT doing, alas) i'm trying
to locate Japanese firms, interested in lisp and its applications, particularly
in education (mathematics and computer science). do you know of such firms
that might be interested in cooperative ventures --them supplying hardware
and me supplying software, books, manuals, and course materials, for example?
unfortunately, i've not been successful in convincing US firms that basic
and pascal can do more harm than good in educating our younger minds, and
that the notions that support lisp have the substance to support
rather than distort creativity. two years of "missionary work" have done
little but leave me in debt, and more than a little frustrated.
I was afraid things would turn out as you say they are.
∂20-Jul-81 0939 TW Comprehensive reading list.
To: JMC at SU-AI, TW at SU-AI, DPB at SU-AI,
feigenbaum at SUMEX-AIM, buchanan at SUMEX-AIM,
genesereth at SUMEX-AIM, lenat at SUMEX-AIM
I propose replacing the entire current AI reading list for the comp with
two items: Winston Chapters 1-9 (already on the list) and the entire
first volume of the handbook. I believe the topics in the other current
readings are covered adequately (and generally better) in the handbook
papers. The exception is Nilsson's Principles, which I believe is too
technically detailed to give for a comp (as opposed to qual). If there
is no discussion or objection, this change will be made to the reading list
before the fall.
--t
In principle I agree with having as few as possible items on the reading
list and therefore go along with the proposal. Might it be possible to
reduce the it a bit more?
∂20-Jul-81 1054 FFL
To: JMC, FFL
If he did not reach you at home, please call Mr. Oakner at 857-9400.
∂20-Jul-81 1109 Denny Brown <CSD.DBROWN at SU-SCORE> tech report deadline
Date: 20 Jul 1981 1106-PDT
From: Denny Brown <CSD.DBROWN at SU-SCORE>
Stanford-Phone: (415) 497-2274
Subject: tech report deadline
To: CSD-Faculty: ;
cc: ddy at SU-AI
Message forwarded to faculty from Dawn Yolton.
You must get COMPLETED reports & PI sheets to me by 7/28 for inclusion in the
next abstract mailing--2 originals if you want fiche AND hardcopy. Dawn Yolton
-------
∂20-Jul-81 1158 Betty Scott <CSD.BSCOTT at SU-SCORE> Supplemental ARPA funding
Date: 20 Jul 1981 1158-PDT
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: Supplemental ARPA funding
To: JMC at SU-AI, TOB at SU-AI
cc: CSD.BScott at SU-SCORE
Bob Engelmore told me this morning that he had talked with Ron Ohlander
at ARPA (Bob's replacement there), and that the $102K which your contract
was shorted this year can be made available from FY82 money (there are no
funds left in the FY81), but that the supplement would be specifically to
finish this year's work.
I have to give some thought as to how this will help the current money
crunch--maybe we could do some "trading" of current expenses for autumn
reimbursement? If you have any ideas, I would appreciate knowing about
them.
Betty
-------
∂20-Jul-81 1315 FFL
To: JMC, FFL
Are you still planning to call Joe Weening about the EKL Manual? If you
wish to call him from home, his work number is 609 924 4600.
∂20-Jul-81 1625 FFL
To: JMC, FFL
Chuck Untulis of SRI returned your call. 859 2641.
∂20-Jul-81 1637 Konolige at SRI-AI meeting
Date: 20 Jul 1981 1638-PDT
From: Konolige at SRI-AI
Subject: meeting
To: jmc at SAIL
John, anytime Tues. or Wednes. this week would be fine for me to
discuss revisions to the MI10 paper. --kk
-------
∂20-Jul-81 2303 LGC Commentary on my philosphy paper on forces
I left a reprint of a philosophy paper on your desk today; you once remarked
that you thought the controversy with Nancy Cartwright in the paper was a
sterile one. In defense, it may be worth mentioning that from the point of
view of AI, Cartwright had come upon a form of the qualification problem, and
had concluded therefrom that laws such as Coulomb's electrostatic law and
Newton's law of gravitation could not be regarded as literally true even from
the point of view of classical physics. What I point out in the paper is that
by recognizing the reality of (i.e., in your terms, "hypostatizing") natural
component forces that are not directly reducible to observable effects, one
can save the truth of the laws while building a blanket qualification into
Newton's second law (a=f/m) that f is the mathematical resultant of ALL the
natural forces bearing on the body in question. Thus, one possible
sloganeering moral of my paper is that, in the representation of causal
knowledge, "hypostatization permits modularization and blanket qualification".
However, in commonsense domains, it is usually not possible to formulate a
single, general numerical law of composition of causal influences, in the
style of Newton's second law.
Well, this is more comprehensible to me than the paper, so it must be the
terms in which philosophical controversies are couched that baffle me. Did
Cartwright have any reaction - or any of the other local philosophers?
∂21-Jul-81 0003 Richard M. Stallman <RMS at MIT-AI>
Date: 21 July 1981 03:03-EDT
From: Richard M. Stallman <RMS at MIT-AI>
To: jmc at SU-AI
I wish you would read my META paper. I think I need help with it,
and nobody else seems to be in a position to read it for a considerable
length of time.
OK, but I may ask a similar favor some time.
1. Say again what file it is.
2. Are you coming out this Fall, and if so, can I choose the time?
Probably after October 1 would be best.
3. Are there any prolog hackers at M.I.T.?
∂21-Jul-81 0202 Jerry E. Pournelle <POURNE at MIT-MC>
Date: 21 July 1981 05:03-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
To: JMC at SU-AI
Date: 13 Jul 1981 2346-PDT
From: John McCarthy <JMC at SU-AI>
Thanks for the copy of "The Survival of Freedom".
Just returned from a week in the Sierra. Seems the mail is
working fast, since I mailed those about a day before you got yours.
∂21-Jul-81 0208 LGC
Cartwright's reaction was that my suggestion is interesting and worth
publication and further investigation in other particular cases; she had
simply taken for granted the reality of RESULTANT forces, and inferred that
the components couldn't also be real, on pain of physical redundancy (cf. pp.
151-152 of my paper). The other local philosophers probably haven't seen the
paper yet (the April issue just came off the press this month).
∂21-Jul-81 0248 POURNE@MIT-MC let me talk you into something...
From: POURNE@MIT-MC
Date: 07/21/81 05:48:38
Subject: let me talk you into something...
POURNE@MIT-MC 07/21/81 05:48:38 Re: let me talk you into something...
To: JMC at MIT-MC
CC: OTA at MIT-MC, TAW at MIT-MC, JEP at MIT-MC
Could you do a short article on damned near anything
relevent to space for the L-5 News? I am trying to up grade the
L-5 News and get some good discussions going in it. It should
be the "respectably far out" journal of space, but it hasn't
always been that.
Net mail to ota or TAW will I am sure cause it to be
printed on paper and forwarded to the proper editorial maw for
printing.
We could really use som high grade articles...
How would you like an article advocating one way missions to the moon
and possibly Mars? These aren't suicide missions, because we are
committed to resupply the astronauts, but they are committed to stay
there for a long time - perhaps even the rest of their lives. The point
is that the rocketry required for one way missions plus resupply is
vastly less than that required to return people, and people who are
there permanently can do vastly more exploration. The risks are no
greater than those endured by nineteenth century explorers. The trouble
is the fear of being blamed by the media - so nothing must go wrong.
We need to overcome this fear.
Another possibility is some version of my article on the feasibility
of interstellar travel based on present science.
∂21-Jul-81 0644 JRA turning out...
well, it's not quite that easy. i spent my time at hp (before commercial
ai was fashionable!) trying to get them to understand what could be done;
i did it because i believed, and i did it without help. now they do seem
to understand, and now they're putting together a reasonable project it
seems.
now to more recent specifics:
i've been promised a very large contract from ti for over eighteen months;
a few months ago they just dropped it --no apologies, no excuses.
i've been promised government money since the first of the year, with due
date march 1; it's now mid-july and still no money.
i was promised a developmental program in computing at santa clara; it got
killed on a political reorganization of the university.
ruth was promised a research position by burroughs for a year (this year).
she requested a sabbatical from santa clara, was granted it, got a
replacement for her position, and was recently told that burroughs changed
their "mind". she is now 8-1/2 months pregnant and we're both unemployed.
for you see, we planned our future on the basis of "promises" made by
"reputable" organizations.
i would rather say that i was naiive in believing that people would do
what they said, rather than say that there was something obviously wrong
with my belief that a lisp-view of computing is viable. i will continue to
do missionary stuff like the lisp conference, the computer faire, and the
cs institute. sooner or later someone will keep their word. in the
meantime, it makes it damn difficult to pay bills, but it does give good
moral lessons: showing my sons what can happen to people when you don't
act as advertised.
so, john, it's not that easy: things could be quite different. ai CAN sell
as lmi, symbolics, and rww have seen. languages CAN sell, as Logo Inc, and
Smalltalk are about to show. i happend to believe that lisp has a hell of
a lot more to offer than logo and smalltalk.
i really WOULD like to contact japanese firms interested in lisp.
∂21-Jul-81 1030 PJH via ROCHESTER where
hi john. im at rochester at last, just arrived. ill be moving around
a lot until after ijcai (buying house, fetching family, etc.),
but am accessible by net. There are many things id like to talk to you
about, but i think ill put them in a letter. hoe all is well with you
im working on the plan..never tried to change it before.
pat
∂21-Jul-81 1221 FFL
To: JMC, FFL
Susan Newman of Benjamin Cummings called. 854 6020.
∂21-Jul-81 1230 Paul.Rosenbloom at CMU-10A Reference for ''Killer heuristic''
Date: 21 July 1981 1515-EDT (Tuesday)
From: Paul.Rosenbloom at CMU-10A
To: jmc at SU-AI
Subject: Reference for "Killer heuristic"
Message-Id: <21Jul81 151504 PR30@CMU-10A>
Prof. McCarthy: I have been looking for the original reference on the
killer heuristic in search. Everyone seems to agree that the idea
originated with you, but noone can come up with a reference on it. I
would appreciate it if you could let me know what it is. Thanks.
-- Paul Rosenbloom
There is no reference. I invented it around 1957 or 1958 and named
it the killer heuristic at that time. It was first used by Paul
Abrahams in a two-move-mate program based on my legal move routines.
Abrahams verified that it did indeed reduce the search required to
do two-move-mate problems, but I'm pretty sure he didn't publish
either. I can't recall if it was used in the kalah programs written
at M.I.T. and Stanford which were described in early Stanford AI
memos.
∂21-Jul-81 1459 Richard M. Stallman <RMS at MIT-AI>
Date: 21 July 1981 17:57-EDT
From: Richard M. Stallman <RMS at MIT-AI>
To: jmc at SU-AI
Coming out around October 1 sounds good to me.
I don't think there are any PROLOG hackers here.
The file is RMS;META >.
∂21-Jul-81 1511 Paul.Rosenbloom at CMU-10A Re: killer heuristic
Date: 21 July 1981 1809-EDT (Tuesday)
From: Paul.Rosenbloom at CMU-10A
To: John McCarthy <JMC at SU-AI>
Subject: Re: killer heuristic
In-Reply-To: John McCarthy's message of 21 Jul 81 16:50-EST
Message-Id: <21Jul81 180922 PR30@CMU-10A>
Thanks for the information; I'll just list it as personal communication.
By the way, this is for a paper I am writing on an Othello program (to
be submitted to AI Journal). -- Paul
∂21-Jul-81 2130 GABRIEL at CMU-20C dog and pony
Date: 22 Jul 1981 0021-EDT
From: GABRIEL at CMU-20C
Subject: dog and pony
To: jmc at SU-AI
How critical is this presentation in your estimation? How careful
should we be to give a good explanation of things? To the point,
the Lisp project here at CMU is gaining good momentum, and if
LGC could handle (to your satisfaction) the presentation,
that would make things better for us here. On the other hand, if you
feel that there is positive gain to my being there, I am more than
ready (I have reservations, ticket, and LLL approval in hand).
By the way will Doyle give a presentation or will we subsume it
somehow?
-rpg-
-------
∂22-Jul-81 0103 Jerry E. Pournelle <POURNE at MIT-MC>
Date: 22 July 1981 04:02-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
To: JMC at SU-AI
cc: JEP at MIT-MC
The one-way mission article sounds just fine. I am trying to
make L-5 News the "respectbly far out" journal of space opinion
and fact; that is, to be sure that what is said is sound, but
encourage new ideas.
Thanks.
∂22-Jul-81 0145 Jerry E. Pournelle <POURNE at MIT-MC>
Date: 22 July 1981 04:45-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
To: JEP at MIT-MC, JMC at SU-AI
Date: 22 Jul 1981 0136-PDT
From: John McCarthy <JMC at SU-AI>
I remember your citing Frosch as having said that it would
be impossible to return to the moon in the 1980s. Of course, a giant
space program could do it, but there may be a way to do it for a cost
the Reagan administration would pay. The question is whether the
Shuttle could land enough payload on the moon for a one way mission.
Naturally, supply rockets could land first and there would be
additional supply rockets afterwards. Do you know or do you have
a reference to the payload the Shuttle could land on the moon?
While I was thinking about including this in my article, it might
be worthwhile to consider launching the trial balloon in a better
way. Perhaps even the Citizens' Space Council might risk its
prestige by suggesting it first. Or maybe it would be better
for them to support it rather than initiate it. Anyway apart from
the politics, I will work up a draft, but it will be light on
details.
Light on details is OK, because we will get Harry Stine to fill
some details in.
I prefere that this go out in L-5 News, and get some discussion
there, THEN be adopted by the Council group (assuming they will
in fact go for it. I am after all chairman, not dictrator, and
I haven't always got them to adopt everything I want.)
∂22-Jul-81 0708 JRA toronto folks
rick holt and friends, from toronto, are in town to teach the operating systems
course at the cs institute. they'd like to talk with someone who has had
first-hand experiince with the boyer-moore prover (since bob and j aren't
around anymore) do you know of someone they could talk with?
No, but I suppose there must be people at SRI in the Computer Science Dept.
∂22-Jul-81 0907 Konolige at SRI-AI (Kurt Konolige)
Date: 22 Jul 1981 0859-PDT
From: Konolige at SRI-AI (Kurt Konolige)
To: JMC at SU-AI
In-Reply-To: Your message of 22-Jul-81 0357-PDT
That's good, I'll see you then. --kk
-------
∂22-Jul-81 1347 Konolige at SRI-AI meeting
Date: 22 Jul 1981 1347-PDT
From: Konolige at SRI-AI
Subject: meeting
To: jmc at SAIL
John, I'm being held up today at SRI, so I will probably make
it over to Stanford by 4pm or so. I need to pick up stuff anyway, so
if you're not there it won't be a lost trip, and we can reschedule; if
you are, we can talk. --kk
-------
∂22-Jul-81 1556 Purger exceeding your disk quota
You have exceeded your disk quota.
The files listed below are being purged to reduce your disk
usage to your quota of 4080
Before purging, your files occupied 4188
ERRORS.TMP[EPI,JMC]
MACLSP.TMP[W81,JMC]
ERRORS.TMP[W81,JMC]
BACKUP.TMP[W81,JMC]
ERRORS.TMP[F80,JMC]
BACKUP.TMP[S81,JMC]
ERRORS.TMP[LET,JMC]
KNOW.LST[S78,JMC]
CONCEP.LST[E76,JMC]
SE2.LST[SEN,JMC]
LIB.LST[ 1,JMC]
∂22-Jul-81 1707 Stan at SRI-AI Re: visit
Date: 22 Jul 1981 1708-PDT
From: Stan at SRI-AI
Subject: Re: visit
To: jmc at SU-AI
cc: nilsson, konolige
I think that would be fine. It would also give Kurt & me a chance
to develop our ideas a bit in reaction to the material you generated
last time.
-------
∂22-Jul-81 2358 ME files restored
Here is a status report on your PUMPKIN requests:
Tape File Status
P2041 LIB.LST[1,JMC] Restored
∂23-Jul-81 1009 FFL
To: JMC, FFL
Gio's secretary needs to know if you will be going to the Faculty Club at
noon on Monday, the 27th, with Machado and the group.
Yes, I'll go to lunch on Monday.
∂23-Jul-81 1031 Konolige at SRI-AI S+P
Date: 23 Jul 1981 1032-PDT
From: Konolige at SRI-AI
Subject: S+P
To: jmc at SAIL
John, I saw your challenge in the AISB quarterly (#37), and a
Prolog response to it. Am I right in assuming that they did not automate
the interesting part of the problem, which is figuring out how the
statements about knowledge affect the constraints on the numbers? --kk
-------
That's right. They only did the arithmetic.
∂23-Jul-81 1310 HEARN at RAND-AI Herbert Stoyan
Date: 23 Jul 1981 1303-PDT
From: HEARN at RAND-AI
Subject: Herbert Stoyan
To: jmc at SU-AI
Herbert Stoyan, an East German computer scientist from Dresden was
recently allowed to emigrate to the West by the GDR authorities. Since
early November, he has been in detention in a Dresden prison on a
trumped-up charge and was only released a few weeks ago. His sole
"crime" was that he asked to emigrate to the West. In the GDR, that
request is sufficient to merit several years' imprisonment (the crime
being "pushing the State"). For example, Egbert Lehmann, who emigrated
last year was given such a sentence, and spent many months in prison
before the potential meeting between Honnicker and Schmidt (which
didn't actually occur) created a climate in which he was allowed to
emigrate.
Herbert has had a long-standing interest in Lisp and AI work in
particular. He has written two books on Lisp (in German, and published
in the GDR - you were given a copy of one at the LISP 80 meeting by Egbert
Lehmann in fact), and has implemented Lisp systems on the ES1040 (the
eastern block IBM copy).
I am trying at this point to get Herbert to IJCAI. I can contribute
$500, but clearly more is needed. Could your institute contribute at
all to this? Also, whom should I approach to see if he can attend the
meeting without paying the registration fee?
The plight of such emigres is fairly severe. They usually have to
leave all their possessions behind, they have to adjust to a new way
of life, and they have little money initially. I hope that you can
help out for what I consider a very worthy cause.
Herbert's English is good enough for a seminar. Maybe you would also
be interested in looking him over for possible employment.
Thanks,
Tony
-------
I have Stoyan twice in the Soviet Union and had a considerable correspondence
with him when he was writing about the history of Lisp. I guess I could
match your $500 contribution, but I don't have a job for him. Can you
MAIL me his current address and phone - if you have it. I presume he
is in West Germany now.
∂23-Jul-81 1358 Darden at SUMEX-AIM welcome back
Date: 23 Jul 1981 1354-PDT
From: Darden at SUMEX-AIM
Subject: welcome back
To: JMC at SU-AI
cc: Darden at SUMEX-AIM
Hi, John, welcome back. How was France?
Unfortunately I don't plan to be at Stanford or IJCAI this summer.
The usual constraints of time and money.
I have been thinking a lot lately about your "pedantic philosophers"
point and I think I have found it operating in the development of
the theory of the gene. I have been looking at the step by step
changes that occured and trying to figure out what happened in between
each step (sort of like looking for the production rules to produce the
steps). One thing I have found is that with hindsight i can find at
least four separable (though not completely logically independent)
assumptions in the law of segregtion that simply were not made in the
early stages. Implict assumptions and clarifying distinctions were
made only in the face of anomalies that threatened the theory. One
can easily implicitly assume something, but in order to deny it one
needs to explicitly understand that one is assuming it. (That wasn't
very clearly stated.) Here's an example: in order to explain 3:1
breeding ratios, one assumed that two types of germ cells were formed,
with pure parental factors (later genes) in them, called A and a.
Although the symbolism (A+a)(A+a)=AA+2Aa+aa was often used, rarely
was it explictly stated that one must have equal numbers of teh
two types and also that the combinations were random. In the face
of exceptions to the 3:1 ratios, various alternative hypotheses were
proposed, including non-equal numbers (called the reduplication theory)
and non-random fertilization (called selective fertilization, naturally
enought). Well, this is going on a bit, but my point is that the
implicit assumptions were made explicit and then denies in order to
account for certain anomalies.
I'll be interested to know how your thinking about common sense is
coming.
Bye, Lindley
-------
∂23-Jul-81 1401 Lee Erman <Erman at USC-ISIB> Engelmore editor of AI Mag.
Date: 23 Jul 1981 1351-PDT
From: Lee Erman <Erman at USC-ISIB>
Subject: Engelmore editor of AI Mag.
To: Minsky at MIT-AI, Nilsson at SRI-AI, Walker at SRI-AI, Bledsoe at UTEXAS-11,
Bobrow at PARC-MAXC, Feldman at SUMEX-AIM, Grosz at SRI-AI, JMC at SU-AI,
Simon at CMU-10A, GJS at MIT-AI, DWaltz at BBND, Webber at BBND,
Woods at BBND, Balzer at USC-ISIB, Buchanan at SUMEX-AIM, Rick at RAND-UNIX,
Tenenbaum at SRI-AI, AThompson at USC-ECL, AAAI-OFFICE at SUMEX-AIM,
Feigenbaum at SUMEX-AIM, Reddy at CMU-10B, Newell at CMU-10A
cc: Engelmore at SUMEX-AIM
Dear AAAI official or hanger-on,
As you are probably aware, the AI Magazine has been living a somewhat
precarious existence. Alan Thompson and the Robotics Age folks have been
handling the production, but no one has been responsible for obtaining
material. Consequently, we have been publishing at an effective of rate of
twice per year, rather than the desired quarterly, on a scrambling basis. In
spite of this catch-as-catch-can operation, the magazines have been of
reasonable quality, and the issue about to be mailed is even bigger and, I
think, better than the previous two. However, it is clear that a better
system is needed.
As publications chairman, I am most pleased to announce that Bob
Engelmore has accepted the position of editor-in-chief of the Magazine. Bob,
who has just returned to Stanford's HPP from his stint at DARPA, will have
full editorial responsibility. Alan will continue to function as executive
editor, with responsibility for production.
Bob will soon start setting up for the full quarterly publication.
Included in this will be the appointment of a number of associate editors, to
help with gathering materials on geographic, subject, and department bases.
In addition, I would like to ask all of you to be always on the lookout for
materials appropriate for the Magazine--send suggestions to Bob
(Engelmore@sumex) of possible items, and encourage your colleagues to generate
and submit materials.
Lee
-------
∂23-Jul-81 1500 HEARN at RAND-AI
Date: 23 Jul 1981 1447-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 23-Jul-81 1350-PDT
Thanks for your prompt and generous response! How would the 17th and 18th of
August be for a visit?
-------
I will be at Stanford on the 17th but must leave for Boston on the
18th. Where is Stoyan now?
∂23-Jul-81 1611 HEARN at RAND-AI
Date: 23 Jul 1981 1609-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 23-Jul-81 1555-PDT
He's in West Germany (in a town called Lage). I'm sure that if you were there
on his first day, he can amuse himself on the second.
Do you want him to give a talk? If so, I'll extract some potential titles from
him.
-------
Let's see the titles, although there may not be many people around at the
time. As you may know, it requires special effort to get a visa that
permits payment of travel expenses and even more effort to be able to
pay an honorarium. I am counting on you to get that disentangled.
What is his actual address and phone number?
∂23-Jul-81 1636 HEARN at RAND-AI
Date: 23 Jul 1981 1637-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 23-Jul-81 1616-PDT
You've raised an issue that I wasn't even going to worry about. Can't we just
pay him an honorarium on a visitor's visa. I've been doing that for years!
-------
Stanford has lately been enforcing the rule against it.
∂23-Jul-81 1713 HEARN at RAND-AI
Date: 23 Jul 1981 1659-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 23-Jul-81 1651-PDT
Hmm, what would you suggest? What sort of visa is necessary? If he arrives
with a visitor's visa, is there any way around it?
-------
No doubt RAND knows how to do it, but I understand that if he has a letter
of invitation that offers to pay expenses or an honorarium, he can get the
kind of visa that allows him to accept it. Ask your local bureaucrat.
∂23-Jul-81 2117 HEARN at RAND-AI
Date: 23 Jul 1981 2117-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 23-Jul-81 1923-PDT
Ok, will do.
-------
Ok, but what are Stoyan's address and phone.
∂23-Jul-81 2137 HEARN at RAND-AI
Date: 23 Jul 1981 2134-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 23-Jul-81 2129-PDT
The address I have (which is that of a relative of his wife's where he has
been staying) is:
Eschenbrederstrasse 33, D 4931 LAGE HOERSTE, West Germany.
Phone is 011-49-5232-8233.
-------
Thanks for the address and phone.
Are you acquainted with the Charles Babbage Foundation, which is concerned
with the history of computing? It occurs to me that they might be interested
in supporting Stoyan's research in the history of LISP if he wants to
continue it. Do you know his job situation in Germany? Does he have
prospects there and does he want to stay there. By the way, the money
bags on IJCAI is Don Walker at SRI. If you don't know him, I can try
for Stoyan, although I already arranged for a subsidy for someone else
with him. What has been your contacts with him?
∂23-Jul-81 2147 HEARN at RAND-AI
Date: 23 Jul 1981 2146-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 23-Jul-81 2143-PDT
I haven't talked to Walker yet; will see if I can get hold of him tomorrow.
-------
∂24-Jul-81 1440 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) AIM reports
Date: 24 Jul 1981 1440-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: AIM reports
To: JMC at SU-AI
cc: DDY at SU-AI, CSD.DBrown at SU-SCORE
John, do you wish to continue the AIM numbering for your reports?
If so, will Frances assign the numbers?
Carolyn
-------
∂24-Jul-81 1735 Vaughan Pratt <CSD.PRATT at SU-SCORE> Sun organization
Date: 24 Jul 1981 1733-PDT
From: Vaughan Pratt <CSD.PRATT at SU-SCORE>
Subject: Sun organization
To: @sun at SU-AI
The biweekly Sun meetings (2 pm Fridays) that I've reinstituted as of
this month are intended as the primary forum for all Sun-related
discussion. If you want to find out more about Sun in general, or to
offer suggestions or effort, or to gripe about designs, production
schedules, etc., come to these meetings. More detailed discussions will
be spun off from the main meetings as necessary.
If you want to suggest, gripe, etc. but can't make it to the meetings, see
me (MJH 330) or call me (7-2943). Don't stew alone, we don't have an
ESP board yet.
-------
∂25-Jul-81 0331 Jerry E. Pournelle <POURNE at MIT-MC> council meeting
Date: 25 July 1981 06:31-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: council meeting
To: POURNE at MIT-MC
cc: JEP at MIT-MC, MINSKY at MIT-MC, JMC at SU-AI, llw at SU-AI
Hans Mark will attend next meeting, which looks to be in
California, probably at the Niven home agian, in late September.
Topics are:
Upper stages
Military space plan: possibilities and approaches.
Other stuff as suggests itself.
We will also have appointment with Beggs to present
results, and in White House for same purpose.
∂25-Jul-81 1000 JMC*
Hurd dinner 6pm
∂25-Jul-81 1231 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #14
Date: 25 JUL 1981 1515-EDT
From: DUFFEY at MIT-ML (Roger D. Duffey, II)
Subject: HUMAN-NETS Digest V4 #14
To: HUMAN-NETS at MIT-AI
HUMAN-NETS Digest Saturday, 25 July 1981 Volume 4 : Issue 14
Today's Topics:
Speech synthesis - Applications, Office Automation - Boon or Bane?,
Telephone System - Phone number semantics & Touchtone,
Telephone Rate Structures - Usage sensitive pricing,
Technology - Appliance micros
----------------------------------------------------------------------
Date: 24 July 1981 05:33 edt
From: Neuman.Datanet at MIT-Multics
Subject: Query
I was intrigued by the recent notes in Human-Nets about voice
synthesis. Has anyone taken the lessons learned from getting
computers to interpret words and pronounce them correctly and
tried to apply them back to the continuing problem of why
Johnny can't read? It would seem that when a kid comes upon
a new word, if he can pronounce it he's more than half way to
a meaningful interpretation, assuming of course that the word
is in his speaking vocabulary. Hmmmm. What about CAI reading
from a CRT with a magic wand that would crisply and clearly
pronounce unfamiliar words? Does the education community have
any idea what the hackers have been up to?
--Russ
------------------------------
Date: 23-Jul-81 20:26:05 PDT (Thursday)
From: Newman.ES at PARC-MAXC
Subject: Mother Jones article on "Office of the Future"
"For those of us who have to work there, the office
of the future is the factory of the past".
That's the conclusion of an article by Barbara Garson in the
July 1981 issue of MOTHER JONES. Entitled "The Electronic
Sweatshop: Scanning the Office of the Future", it's a clerk's
eye view of the effect of word processing, "distributed data
entry", and other office technology on the people who must
operate it for a living.
A particularly insidious development discussed in the article
is the use of such technology to monitor the performance of
its user (how many keystrokes per hour, how many hours per
day spent on a particular task, etc.)
You may disagree with Ms. Garson's conclusions (she sees the
new technology as a step toward the de-skilling of secretarial
and other white-collar professions), but the article is an
important reminder that many workers see the automated office
as a threat rather than an opportunity.
/Ron
------------------------------
Date: 24 Jul 1981 at 2226-PDT
From: zaumen.tscb at SRI-UNIX
Subject: Mother Jones and VDTs
Maybe I missed something, but after reading the article
about how unpleasant the author found VDTs, I realized that (s)he
had really missed the issue -- one that permeates our society.
The author (and several Human-nets contributors) have actually
discovered the "radar trap syndrome". This syndrome occurs in
two stages:
1) Stringent laws or regulations are set up to solve some real
problems (say, speeding). These laws or regulations are
often overly harsh because it is frequently difficult to
catch someone breaking them, and someone who is blatant
enough to be caught is usually a real menace.
2) A new technology (such as police radar) comes along and
makes it a lot easier for a miscreant to be caught. The
result is that a lot of minor violators -- ones who are
technically in violation, but really doing no harm -- are
caught too. With the previous technology these would
normally be ignored.
This syndrome is a real problem for designers of work-stations,
etc., because variations in user's behavior that would otherwise
not be detected can be blown out of proportion. Unfortunately,
inclusion of performance measurements is often a strong selling
point (the buyers are not the users). Then too, unlike clerical
workers, a programmer's productivity should be measured not only
by the lines of code written per day, but also by the lines of
code not written, and consequently system designers do not expe-
rience the adverse consequences of such monitoring procedures.
------------------------------
Date: 24 Jul 1981 1317-EDT
From: KERN at RUTGERS
Subject: A question about wrong numbers.
People often reach my home phone by dialing wrong numbers; I
always ask what number they were dialing. Very often, the number
they were dialing is completely different from my own, even down
to a different exchange in my same local area. Does anyone know
why this is? Is there a sort of sparse matrix tying unused
telephone numbers together?
-kbk
------------------------------
Date: 25 July 1981 13:06 edt
From: Frankston at MIT-Multics (Bob Frankston)
Subject: Direct Inward Dialing
Direct inward dialing is fairly simple -- the line is treated like
any other extension. A reasonable installation provides it with a
restricted class of service that would allow it to reach only
internal extensions.
One could add, on top of that, an internal extension that provides
a wider class of service and then be silly enough to give that a
generally guessable code. The motivations for doing such are too
allow use of a company's tielines and for billing of calls to the
company without use of a credit card.
PS: MIT's Centrex is ESS -- it was installed in 1969 (or 1970-1?).
It has also used up all available downtime for the next century
or so (at 2hr/40 years) the night it was installed.
------------------------------
Date: 24 Jul 1981 0949-EDT
From: Eric K. Olson <OLSON at DEC-MARLBORO>
Subject: Abbreviated Dialing
To: JSOL at RUTGERS
The town I live in (Harvard, Mass) had a mechanical switcher
until a few years ago, and now they have (what they call) ESS.
It
1) Does not offer touch tone
2) Does not offer a special abbreviated dialing service
(but see below)
3) Is slow
4) Etc.
We have always had the following dialing ability:
The local dialing area is Harvard (exch 456), Ayer (772), and
Littleton (486). To dial a number in Harvard, dial only the last
four digits (all numbers in Harvard are 456-3XXX or 456-8XXX or
(for pay phones) 456-93XX). To dial a number in Ayer or Littleton,
dial the seven digits. To dial anywhere else in 617 area, dial
1-seven digits. To dial other area codes, 1-area-seven digits.
Get this: We Do have direct international calling. We have 411
directory assistance, but no 911 emergency or 511 (?) repair. We
cannot get metro Boston service, although we are a mere 30 miles
away.
------------------------------
Date: 23 Jul 1981 11:12:37-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
Subject: touch-tone
FYI: When I was in Chicago, getting a dataphone installed for a
computeresque exhibit (NICE V), the installer found that the phone
he'd put in wasn't getting anywhere because someone "back at the
office" hadn't made a specific change in the switching machinery
attached to that line that would allow it to understand touchtone.
Thus I can see a \\one-time// conversion charge; a monthly charge
is something else again (though in this state telco is now required
to split that charge into a line fee and an incremental instrument
cost, the latter of which is believable if you don't buy your own
phones).
------------------------------
Date: 23 Jul 1981 1514-MDT
From: Spencer W. Thomas <THOMAS at UTAH-20>
Subject: Touchtone Polarity
I had this problem, got it fixed (the Telco repairman switched
the wires INSIDE the phone), and then when I got a new phone, of
course it didn't work again! It seems to be a common problem,
when I called up to report it, the guy I talked to knew exactly
what the problem was.
=S
------------------------------
Date: 24 Jul 1981 14:50:32-PDT
From: decvax!duke!unc!smb at Berkeley
Subject: Touch-Tone phones
My thanks to all those who replied, either directly or via
the mailing list. The phone company got the problem fixed
the next day, as I had expected; my question was mostly out
of curiosity about how the thing worked. I had naively
assumed that the polarity would always be right, and had
WONDERED why some schematics I have showed an optional
rectifier across the line....
------------------------------
Date: 25 July 1981 06:27-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
To: TRB at MIT-MC
You will appreciate Ma Bell after you visit:
(1) Paris
(2) Buenos Aires
(3) Sao Paolo
(4) Anyplace in the Sov World, especially including Moscow.
US has cheapest and most effective communications, most widely
available, of anywhere in the world. If we work real hard we
can change that.
------------------------------
Date: 24 Jul 1981 20:52:46 EDT (Friday)
From: Dan Franklin <dan at BBN-UNIX>
Subject: new oven
From the Matsushita Electric ad in FORTUNE, August 10 (p. 27):
A TALKING OVEN THAT ALSO SEES
The new "Show and Talk" microwave oven does just about every-
thing but go out and do the shopping. At the press of a button
its built-in 5" TV (meas diag) shows you a selection of recipes
and the ingredients needed (it will also give you a printout),
responds to your verbal instructions, and announces in its own
voice when the meal is completed. The built-in TV can show you
how your recipe will look or let you watch your favorite TV
show. It can even be hooked up to a closed-circuit TV system
so you can see what's happening in the children's bedroom or at
the front door.
Bet it won't sell until it plays Space Invaders...
------------------------------
End of HUMAN-NETS Digest
************************
I cannot accept the Mother Jones article as a clerk's view of office
automation without further verification. The problem is that Mother
Jones has a prejudice that new technology introduced in a capitalist
society is more likely than not to be harmful to workers. Therefore,
they encourage writers who look for facts tending to confirm this view
and solicit statements from workers confirming it and to ignore improvements
in working conditions resulting from the new technology. I scanned
the Mother Jones article, but I forget whether it mentions the benefits
of not having typewriters clacking away in an office. I assume that
Barbara Garson is a writer not a clerk.
I have not observed mass clerical work, but I have observed the effect
of the use of text editors (like E and EMACS) and text formatters (like
PUB and TEX and SCRIBE) on secretaries and typists. The effect has been
to differentiate skills. Those who have learned to be at home with
computers and use them in a sophisticated way have a premium skill.
We are allowed to pay them something extra, but not enough. Namely,
they are often hired away from us by companies with less rigid personnel
departments than Stanford University.
Productivity measurement has two sides to it. On the one hand it lends
itself to all kinds of petty tyranny. On the other hand it increases
productivity which makes the company less resistant to wage increases.
A company will take a long strike if the consequences of giving in to
the demands are to put it from a profitable position to a loss, while
it will resist much less if it can do so without reducing its profits
much and can hope to make up the immediate cut in profits by an increase
in volume. Also a productive company will bid higher for skills it
wants and will be more likely to match offers from the outside.
∂25-Jul-81 1723 TOB
To: JMC at SU-AI, csd.feigenbaum at SUMEX-AIM
Lockheed is trying to offer a complete CADAM system to
Mechanical Engineering and Aero and Astro. It runs on an
IBM 370/xx.
ME has decided that it would cost too much to maintain for the
benefits of giving students access to it. That seems like a
wise decision.
Is there any interest in the system from our viewpoint? It would
cost space and some maintenance. Could CIT do it more effectively
than Mechanical Eng?
What more would be required for the system to run on the 4331?
∂25-Jul-81 1739 TOB
It comes with lots of display terminals. I don't know what
all it requires, or how much is involved in the conversion.
Tom
ail Jul-81 1730 JMC
What more would be required for the system to run on the 4331?
∂26-Jul-81 1538 pratt@Shasta via Ethernet
Date: 26 Jul 1981 10:54:42-PDT
From: pratt at Shasta
To: jmc@sail, reg@sail
Subject: File server Vax
Cc: avb, pratt
(Reply to pratt@score, sorry about that but Sail doesn't have the software to
mail to Shasta yet.)
Having had a couple of days to mull over your offer to purchase a Vax and 4
Gigabytes of memory, I am now 100% behind such a move. First, there is a
very critical need for netwide storage that would be met to some extent (see
remarks below) by this machine running as a file server. Second, it would be
a very good thing for CSD to have its own Vax. Diablo is an HPP/Sumex
machine, and Shasta is a CSL machine paid for by VLSI money and about to go
to ERL. This leaves the rest of CSD essentially Vaxless, which is just
now starting to make me a bit nervous.
If there were closer CSL-CSD ties this second reason would not be so critical.
However, in the time I've been here I've been getting the feeling that there
is some tension between CSL and CSD. I don't yet understand the
problem, although the issue of geographical separation seems to come up more
often than other issues whenever I talk to the CSL people about these things.
I would like to see this apparent rift repaired somehow, particularly since I
like the CSL crowd a lot. Meanwhile we (meaning CSD, since that's where I
want to work) should not plan under the assumption that it will be repaired
right away.
Now let me expand on the "to some extent" above. Our present plans call for
a less centralized file server, for four reasons: robustness, localnet match,
economy, and efficiency.
Robustness. As the net community grows more dependent on the file service
supplied by SUNet the reliability of that service will need to improve. In
particular it will not be acceptable to have a single computer stand between
the community and its files. The plan is to distribute file service among
several file servers, and to ensure that there is enough duplication of files
to get the probability of a given file being unavailable on a given day down
to 0.01% or less.
Localnet match. As we become more dependent on the Ethernet we will find that
one net no longer meets our needs. The plan is to have 3 Mbaud Ethernets
local to each floor, connected to the present Ethernet by gateways. Thus the
present Ethernet will turn into a trunk line service. As such it is not a
suitable host for file servers, which should be matched to the local nets.
Local nets will appear quite early in the growth of SUNet as they require no
additional hardware beyond what we already have, and their software is already
appearing - for example there is already a working gateway between our
Ethernet and Sumex's.
Economy. The current plan calls for 68000's rather than Vaxes as the
processing element of a file server. A 68000 is about 40% of the speed of a
Vax, but about 2% of the cost (not counting the disk-controller and disks).
Efficiency. Requests for files coming simultaneously from many users are
well dealt with by multiple servers, since the requests from different users
will be essentially independent. A single processor, especially one running a
system as slow at accessing files as Berkeley Unix, will have a hard time
keeping up with a heavy demand. Of course if you put as many Vaxes as we were
planning to put 68000's on the local nets as file servers then you'd be ahead
of the game in efficiency, but you'd also be very broke.
Offsetting these concerns are the following.
1. We can still use the Vax - in fact we have a very pressing need for
one.
2. We don't have a suitable Multibus disk controller, though we would
like to start work on one. The present personnel situation suggests that
unless we increase the already high priority of a disk controller we
will not start on such a project before January, and that it would take
roughly three months to produce 10 wirewrapped disk controllers. Thus we
must think of such a plan as fairly long range.
These two considerations essentially negate the preceding concerns as far as
the next 12 months are concerned. Furthermore, when we do move to a more
distributed scheme, whether on the above schedule or later (schedules have a
nasty habit of slipping), the Vax and its storage will continue to be very
useful.
If you would care to change your plans to make it two Vaxes I'd be even more
enthusiastic. This is something we can discuss further; I'd like some
feedback on the above from everyone involved before getting too mired in the
details.
Vaughan
∂26-Jul-81 2028 AVB Xerox announcement on Dolphin/1100
To: "@SUN.DIS[P,DOC]" at SU-AI
Date: 22 Jul 1981 1736-PDT
From: RINDFLEISCH@SUMEX-AIM
Subject: INFORMATION RE INTERLISP DOLPHINS
Ed Feigenbaum received the following message from Mr. R.E. Bomeisler,
Marketing Manager for Xerox EOS, in response to repeated requests for
more information about Dolphins necessary for planning acquisitions.
Since others may be in the same situation, Ed wants to pass the
information along to other computer scientists. You may forward
it if you wish.
Tom R.
*********************************************
7/16/81
"In our telephone discussion, Ed, you indicated that Xerox
was not providing you and potential users with enough information
to assist you in designing your networks and planning for future
growth. I would like to apprise you of the steps we have taken
at XEOS to fill the information gap.
Marcel Pahlavan is the program manager and is the focal
point for responding to customer inquiries on interface and other
technical matters. On August 1, Terry Haney will join the staff
to provide hardware expertise. An Interlisp software expert is
being actively recruited. In addition, Pahlavan can call on other
system experts within XEOS to solve specific customer problems.
With regard to 3M bps Ethernet networks, the 1100 system
includes the hardware necessary for connection. In addition,
XEOS will make available the hardware necessary to connect the
DEC Unibus. This includes the DEC Unibus Ethernet Interface
Board, Transceiver, Terminator and Connector. This hardware
enables connection to 3M bps Ethernet on the DEC PDP-11 family
aswell as the DEC 2020 and the VAX family. To connect the
DEC 2040, 2050, and 2060 to 3M bps Ethernet will require either
development of a Massbus Ethernet Interface Board or a PDP-11
front end interface. When either of these is developed within
the ARPA-sponsored research community, XEOS will facilitate
distribution.
XEOS is a systems organization with the skills to develop
special hardware or software. It is expected that we will be
called upon to modify the 1100 hardware or software to meet
special customer requirements.
With regard to DEC hardware/software, there exists within
the ARPA research community a number of special systems. Many
of these exist on your own campus. As we become familiar with
thesesystems, XEOS will serve as a facilitator and will make
certain that potential 1100 users are familiar with interface
software that exists or is under development. To the best of
our knowledge, the following systems have been or are being
connected to the 3M bps Ethernet: KI-10/TENEX, KL-10/TENEX,
2020/TOPS-20, 2050/2060/TOPS-20, and VAX/UNIX. XEOS will
facilitate distribution of the Stanford-modified PUP software.
As you know, this software runs under TENEX and TOPS-20 and
enables DEC KA-10, KI-10, KL-10, and DEC 2020 to act as file
server to the 1100.
The dissemination and distribution of information would
be greatly enhanced by formation of an 1100 users group. XEOS
is prepared to assist in the organization of such a group.
XEOS plans to make available the necessary hardware and
software to connect the 1100 system to the 10 M bps Ethernet,
thus providing access to the Xerox 8000 Network System. We
are also investigating the feasibility of an internet gateway.
With regard to 1100/Interlisp performance, continual
improvements are being made in the code. The system is five
times faster than it was a year ago and significant further
improvement is expected.
Since the 1100 is a powerful, flexible machine, it can
be expanded in a number of ways: physical memory from 576K
words (1.15 M Bytes) to 768K words (1.54 M Bytes), virtual
address space from 4M to 16M words, and increased local disk
storage capacity. Furthermore, there is sufficient cabinet
space to add special functions that might be needed by certain
customers: floating point arithmetic, color display interface,
image processing, and other special logic, etc. XEOS is inves-
tigating the feasibility of adding to the 1100 system: color
display, low cost bit map display, large capacity file server,
and 5700 electronic printing system. The architecture, I/O
structure, and bandwidth of the 1100 make it the ideal machine
for dedicated applications in the research and scientific
environment.
In addition to Interlisp, XEOS is planning to implement
Smalltalk on the 1100. The schedule is yet to be determined.
As a key ingredient of the overall 1100 program, it is
planned to release a version of Interlisp on the Star processor
after January 1, 1983. This will provide Interlisp to future
users on a very cost-effective basis.
I trust, Ed, that this information will enable you and
others to plan system expansion."
-----
∂27-Jul-81 0741 DDY
∂24-Jul-81 1440 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) AIM reports
Date: 24 Jul 1981 1440-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: AIM reports
To: JMC at SU-AI
cc: DDY at SU-AI, CSD.DBrown at SU-SCORE
John, do you wish to continue the AIM numbering for your reports?
If so, will Frances assign the numbers?
Carolyn
-------
Is this something that you and Denny had discussed? Funny you should mention it
at this time, as Denny mentioned it to me only last Thursday and wants to bring it
up at the faculty meeting Tuesday morning. Dawn
∂27-Jul-81 0834 FFL
To: JMC, FFL
Please call Miss Waldron at American Express. 305 473 3552.
∂27-Jul-81 1041 cjh at CCA-UNIX (Chip Hitchcock) offices and MOTHER JONES
Date: 27 Jul 1981 13:33:44-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
To: human-nets at mit-ai
Subject: offices and MOTHER JONES
Cc: JMC at su-ai
1. Barbara Garson is a writer who has frequently had to work as a clerk
since she writes what she wants to rather than what will earn big bucks.
(On the other hand, her best known work is MACBIRD, which puts a
prejudicial light on her evaluations of the present.) As for the
2. "...benefits of not having typewriters clacking away in an office."??
In a computer company the output device for word processing can be in
the machine room, where its greater noise levels don't matter (a Spinwriter
is \\much// noisier than a Selectric); offices don't always do this. There
are several other reasons why this argument is untrue.
3. JMC's analyses of productivity effects are again assuming a perfect
economy. As a sample opposition, I suggest that the people against whom
productivity figures are generally used are so badly paid in comparison
to their managers that their wages form only a modest part of the
company's costs.
4. As noted previously, I concur that MJ has a bias, but the
article in question has statements (and refusals to make statements) from
a revealing spectrum of people.
∂27-Jul-81 1219 RPG
will doyle be there tomorrow?
I don't anticipate that Doyle will be there - 252 I guess.
∂27-Jul-81 1727 WIEDERHOLD at SRI-AI Schedule
Date: 27 Jul 1981 1416-PDT
From: WIEDERHOLD at SRI-AI
Subject: Schedule
To: jmc at SU-AI, csd.betty at SU-SCORE
cc: mach at USC-ISIC
If you think you will be done by 11:30 tomorrow, then Betty
might want to get together with John Machado then.
She has a lunch time meeting.
Gio
-------
∂27-Jul-81 1802 HEARN at RAND-AI Stoyan Visit
Date: 27 Jul 1981 1403-PDT
From: HEARN at RAND-AI
Subject: Stoyan Visit
To: griss at UTAH-20, jmc at SU-AI, psz at MIT-ML
I would like to thank you all for your contributions to Herbert's visit. I've
prepared the following info about his visit which I thought might be useful
to you in your own planning.
DR. HERBERT STOYAN
Current Affiliation: University of Dortmund
Current Address: Eschenbrederstrasse 33, D4931 LAGE HOERSTE, WEST
GERMANY
Telephone: 011-49-5232-8233.
Citizenship: West Germany
Seminar Topics:
1) Artificial Intelligence Research in East Germany
2) The History of LISP
3) TULISP and other implementations of Lisp in East Germany
ITINERARY FOR VISIT TO THE USA AND CANADA
August 4 Flying to Salt Lake City
August 5-7 SYMSAC '81 (Accommodation at the Cliff Lodge,
Snowbird)
August 8-11 Salt Lake City (Professor Martin Griss to
arrage accommodation)
August 12 Traveling Salt Lake City to Los Angeles
August 13 Visiting Rand Corporation
August 14-16 Sightseeing, Los Angeles area (traveling to
San Francisco either Sunday night or Monday
morning)
August 17-18 Visiting Stanford area (Professor John McCarthy
to arrange)
August 19 Traveling to Boston
August 20-23 Visiting MIT and Boston area
August 24 Traveling to Vancouver
August 25-28 IJCAI (accommodation at campus housing)
August 29 (?) Returning to Germany
-------
∂27-Jul-81 1802 HEARN at RAND-AI
Date: 27 Jul 1981 1322-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 23-Jul-81 1923-PDT
Stoyan has a B-1 and B-2 visa. I think that is sufficient to pay him (hope so!)
He already has the visa, so it can't be changed now.
-------
I think it can be changed and I suspect it must.
∂27-Jul-81 1805 JRP forwarding barwise's mail
should barwise's (byy) forwarding address be put on the
list? it is, barwise.uwisc@udel. I would doso if
i knew how. j.perry
∂27-Jul-81 2151 ME
To: BYY at SU-AI, JRP at SU-AI, JMC at SU-AI
OK, mail for BYY is now forwarded.
∂28-Jul-81 1408 PJH via ROCHESTER where
hi john. where are you? I had heard that you were in France.
Will you be at IJCAI?
I will be back in England from 31 july to 12 August, by the way.
Pat
I'm back at Stanford, I will be at IJCAI and also at the logic programming
meeting on the Queen Mary just before. See you.
∂29-Jul-81 0026 LLW John McCarthy Visit
To: CEG
CC: LLW, TM, JMC
Dear Chris:
Professor John McCarthy of Stanford University (a US citizen) would like
to visit the Project on Wednesday, 5 August. Please check with Gloria re
calendar conflicts and let me know. Also, please check with Shirley and
Judy in ET's offices re whatever he's committed to this past day and
tomorrow at the White House, as I agreed to be there to help him whenever
it was required, no matter what else. I need to set a specific time with
John, and you need to arrange for a red badge for him for that time.
Thanks,
Lowell
∂29-Jul-81 0615 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #17
Date: 29 JUL 1981 0856-EDT
From: DUFFEY at MIT-ML (Roger D. Duffey, II)
Subject: HUMAN-NETS Digest V4 #17
To: HUMAN-NETS at MIT-AI
HUMAN-NETS Digest Wednesday, 29 July 1981 Volume 4 : Issue 17
Today's Topics:
Atlantic article on hardware debugging,
Office Automation - Boon or bane?,
Telephone Rate Structures - Usage sensitive pricing,
Telephone System - Foreign phones,
Telephone Services - Foreign directories, FYI - NCC82 Call for papers
----------------------------------------------------------------------
Date: 27 July 1981 10:40-EDT
From: Al Lehotsky at METOO at GALAXY at VAX4
Sender: Steven H. Gutfreund <SHG at MIT-AI>
Reply-to: "Al Lehotsky in care of" <SHG at MIT-AI>
With respect to John McCarthy's theorizing on the DG Eagle being a
"rush" project.
Within VAX development, we had the "intelligence" [in the
military sense] that DG had decided to develop a HLL [High-
Level Language] machine, ala the B1800.
They made the incredibly stupid decision to move the entire
project to Chapel Hill, N.C. in the middle of the development
effort. As a result, a lot of their people supposedly left
the project and they had trouble hiring new people who were
willing to move South.
I also think that they were attempting a too ambitious design,
given their corporate resources. [To be fair, I believe that
DEC was too conservative in the VAX-11 design.]
I intend buy the Project History Book when it comes out. It
should be fascinating reading to compare their efforts with the
corresponding DEC history.
------------------------------
Date: 28 Jul 1981 12:30:23-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
To: Leavitt at usc-isi
Subject: Re: future office
An excellent point about the utility of measuring productivity
effects of innovation. The problem with keystroke monitors is that
no baseline exists, since the innovations include the capacity for
such monitoring. The floors set by the monitors are therefore
somewhat arbitrary.
Of course, if you want to try out a new data-entry format,
the monitors are a win. The problem there is that such monitors
don't seem to measure a more important factor: the total number
of \\records// processed. Garson's article describes a system
with a number of fields which were virtually always the same;
a more complex monitor would be necessary to determine the
effectiveness of an entry program which pre-fills these fields.
(This runs into a management problem --- the productivity reports
themselves become more complicated when the selling point \\to//
\\managers// of such systems is the simple indices they provide.)
My personal reaction on reading that what Garson was doing was
entering handwritten slips was that the entry really should have
been done by the high-powered types who were writing up the slips;
unfortunately, there's still a lot of resistance to this because
use of a terminal is considered low-class. (Another division of
my company sells an electronic mail system; they report relatively
little difficulty in persuading upper-level types to type, but
I expect that private use of a terminal seems different from
using one to record the transactions of a face-to-face customer.
(deleted long flame on"status"). One material problem is the
potential capital cost of larger numbers of terminals and wiring
a wider area, but I would expect a good payoff on such an
investment.)
The above leads into a potentially arguable topic which I
will point to rather than expound: consider the offhand remark in
Brunner's THE SHOCKWAVE RIDER that almost nobody has decent hand-
writing because typing is universally taught at age 6 or 7. How
do we get to there from here?
------------------------------
Date: 28 Jul 1981 1236-EDT
From: Eric K. Olson <OLSON at DEC-MARLBORO>
To: TRB at MIT-MC
Subject: Keystroke counter
I think that a more valid statistic is keystrokes per character in
final document. This would mean that the error-free typist would
get a lower (better) score than the error-prone typist, or the one
who type jkl;jkl; a lot and then erases it.
------------------------------
Date: 28 July 1981 11:23-EDT
From: Robert Elton Maas <REM at MIT-MC>
Subject: Mother Jones and VDTs / strict harsh enforcement
As I see it, the problem isn't the radar for measuring speed, it's
the threshold whereby iota under the speed limit is 100% legal and
iota above the speed limit is a horrible crime punishable by a
nasty fine. This same problem occurs in welfare, sometimes, where
if you earn iota less than some limit you get full benefits but if
you earn iota more than that limit you lose everything. The right
way is to have things graduated. As you start to slightly exceed
the legal speed limit you are taxed a teensy bit. As you exceed it
more you are fined a little more. Only if you exceed it greatly
are you actually stopped. Of course if you exceed it slightly for
a long time you'll accumulate a lot of taxes or fines, but since
the rate is low you'll accumulate the taxes&fines slowly, and each
additional minute you violate the limit slightly you accumulate
only a teensy bit more.
I think the same should be done with pollution, and other
continuously-measurable violations of the ecology or of society.
The more uniformly and continuously (in mathematical sense, i.e.
high-precision A-to-D) the transgression can be measured the more
fairly the person or company can be charged for the damage heesh
or they cause others.
I hope when keystrokes or lines of code produced etc. are measured,
that the measurement is used on a continuous basis to decide how
much to pay the person, rather than testing the production against
some threshold and firing or severely punishing the offender. I
think it encourages cheating and ripping off to set some arbitrary
threshold and then let people violate right up to that threshold
without any tax or fine at all, then suddenly jump on the person
for slightly crossing the threshold. First it encourages the
person to try to get as close as heesh can to the limit/threshold.
Then if by accident the person crosses the threshold it encourages
the person to try to forge the data to make it look like it was
under the threshold.
I hope these measuring devices/technologies are used reasonably.
I hope (in vain) that people won't blame the technology, but will
blame the manager, when they are used in bad ways. There IS a
choice, beyond just "all-technology or no-technology".
------------------------------
Date: 29 July 1981 04:33-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: Mother Jones article on "Office of the Future"
Of course Ms. Garson sees ALL technology as a blow against
the workers...
------------------------------
Date: 28 Jul 1981 1307-EDT
From: Eric K. Olson <OLSON at DEC-MARLBORO>
To: LEAVITT at USC-ISI
Subject: Keystroke Monitors
I don't think that management can be trusted with the keystroke
statistics from secretaries. Look what the (supposedly) did with
phone operators and laser-scanned checkouts.
It is important that the data be available only to the system
maintainer, and this is not difficult: just encode it very
simply as it is written, and don;t give management the program
to read it out. And don't tell them it exists, or even that
the statistics are being kept.
------------------------------
Date: 27 Jul 1981 13:37:34-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
Subject: rural phones
I can't vouch for the whole country, but I lived for a couple
of years in a marginally rural area with an independent phone
company. The area stretched from Pine Plains to Hillsdale, in
New York roughly halfway between Poughkeepsie and Albany and
between the Hudson and the Connecticut border. Unfortunately,
I can't give you any data on costs or services since this was
when I was young enough not to care.
------------------------------
Date: 27 Jul 1981 1715-PDT
From: ROODE at SRI-KL (David Roode)
Subject: U.S. phone service
Agreeing that is good, I still must question the premise that
by seeking changes we risk reducing it to the level of service
found in various other countries. I believe the reason that
we criticize is the same reason it is good. In this country,
people demand good phone service. The national attitude holds
that the phone is important. No matter what they are doing,
people drop everything to rush to answer the phone when it
rings. This is especially noticeable in retail stores. Why
should the customer on the phone have priority over the 3 in
line at the counter? It's the American way.
I think usage-sensitive pricing bodes no special ill for the
future. It is a myth that businesses subsidize residential
users. The recent drastic increases in WATS tariffs provide
an example of businesses receiving a break not offered to
residential users.
There is an inherent situation where certain resources are
placed at peak usage levels during the work day, and then
typically are best offered at a discount during non-working
hours. The increased volume more than makes up for the
decreased profit per unit transaction. The home use of
computers during off hours that is starting to occur is
another example of this. Another is the nature of air
fares. It is simplistic to say simply that business is
subsidizing nonbusiness, but if you say it about telephone
service, you must realize it is much broader, and would not
be easily changed.
------------------------------
Date: 28 Jul 1981 1930-PDT
From: Mike Leavitt <LEAVITT at USC-ISI>
Subject: More on "Ma Bell"
1) Don't any of you logical engineer types want to comment
on the logical quality of the argument that goes: phone
systems are lousy in other countries; AT&T has been better
than government run phone systems in other countries;
therefore, don't muck with anything that AT&T does.
2) I am no longer going to refer to AT&T as "Ma Bell." It
euphemistically benignifies an organization that doesn't
deserve it. Who's for calling IBM "Uncle Watson?"
Mike
------------------------------
Date: 27 July 1981 0535-EDT (Monday)
From: Michael.Shamos at CMU-10A
Subject: Organization of Moscow Phone Book
While Jerry Pournelle was quite right that telephone service
in Moscow is egregious (no need to worry about lines being
tapped -- the parties themselves can't even hear each other!)
we might still have something to learn from the way in which
their telephone directory is organized.
The Moscow phone book is an information science curiosity;
it is both ludicrous and profound. You can't look up any people
in it; not a single proper name is listed in the 600-page volume
even though its official title is "List of Subscribers to the
Moscow City Telephone Network". However, you can find the
nearest drugstore to you far faster than you can by using our
Yellow Pages. The secret is that the structure is both organi-
zational and geographical. The entire book is a hierarchical
outline of the entire government (which in Russia is all there is)
reminiscent of US Government telephone books. (You can pick up
the Pentagon directory for a few bucks at any Government Printing
Office Bookstore; it's well worth it for the insight it affords
into the structure of DOD.) The first number in the book is for
the presidium of the Supreme Soviet; the second is for the Council
of ministers, and so forth down the government ladder to the last
entry, which is for City Laundromat No. 32, at 26 Yasnii Prospekt
(I kid you not.) The KGB is the 15th entry; it's phone number is
221 07 62. A parenthetical note tells us that the number answers
24 hours a day. You can immediately tell the importance of an
organization by what page it is listed on.
The geographic information is diverse. Police stations are
numbered by precinct and listed in numerical order. Food stores
are listed by street and by house number within street. Very
little of anything in Moscow has a name; the numbering is carried
to extremes by US standards -- there are 2,020 kindergartens in
Moscow and they are all listed in the phone book in numerical
order. A section at the end of the book contains several dozen
regulations governing telephone use; the first of these is that
no call may last longer than four minutes. Trivia: the number
of the Fire Department is 01, Police 02, First Aid 03 and MosGaz
(the gas "company") 04. "Time" is known as the "Talking Clock"
and its number is 100. Foreign embassies are not listed. The
book is a marvel and is a best-seller. (It's hard-bound and is
not free.) You can really wonder what they did before 1975, the
year in which the phone book was first published!
------------------------------
Date: 28 July 1981 17:59 edt
From: Frankston at MIT-Multics (Bob Frankston)
Subject: NCC 1982 Personal Computer Sessions -- Call for papers etc.
The 1982 National Computer Conference will have a track (i.e.,
a group of sessions) on personal computers. This means that
the papers will be refereed and appear in the proceedings.
This is in contrast to past years in which there was a separate,
unrefereed "subconference".
This reflects the growth and importance of personal computers.
But it is also a challenge. We must organize a new set of
sessions and get new referees. Part of this challenge is in
finding a balance between sessions on the mature areas in
personal computing and capturing the innovation in ongoing
research and development, both in academic and commercial
projects. Workshops might provide a better forum for the
latter.
Some of the possible topics include:
- what are personal computers -- the definitions range
from Alan Kay's dynabook, to miniature mainframes to
workstations.
- what personal computers are not.
- specific applications and issues such as wordprocessing
(though word processing also falls under office automation)
- Protocols and standards
- Networking as it relates to personal computers. This
can represent both local area networks as well as ad
hoc telco networks.
- Operating systems -- both traditional and new concepts
- Languages
- Consumer computers -- issues in design, implications of
a software marketplace.
- Education -- traditional and otherwise, computer and
noncomputer
- Implications and relationships to other fields both
within the industry and in the rest of the world.
Societal interactionals.
- Hardware trends and issues
- Games, both recreational and educational.
I am on the NCC steering committee and am in charge of
organizing/creating these sessions. If you have any suggestions
or comments, and if your are interested in participating by writing
a paper, refereeing or whatever, please contact me either as:
nccpc82.SoftArts at MIT-Multics
or
Bob Frankston
Software Arts, Inc
PO Box 527
Cambridge, MA 02139
or 617-491-2100.
------------------------------
End of HUMAN-NETS Digest
************************
∂29-Jul-81 1004 energy at MIT-MC question re solar hot water
Date: 29 July 1981 12:57-EDT
From: energy at MIT-MC
Sender: OAF at MIT-MC
Subject: question re solar hot water
To: energy
Date: 28 Jul 1981 2120-EDT
From: KING at RUTGERS
Subject: New design for solar hot water reported in Times
To: energy at MIT-MC
In last Wednesday or Thursday's times (7/23 or 7/24) there was
a diagram of a new type of solar hot water heating system designed by
the Arthur D. Little Co. There was no antifreeze loop. The water ran
as follows: from the street's cold water feed, through a valve,
through the collector, through another valve, into and through an
accumulator tank, and into the hot water supply. I can't see how this
can work, because water will only flow through the collector during
the few moments when someone is actually drawing hot water. If the
idea is to provide large amounts of storage capacity in the collector,
that's very interesting, but why the accumulator tank?
Can anyone who has read the article tell me more?
Dick
-------
∂29-Jul-81 1018 KGK via SRI-AI corner-quotes
John, I have typed up a TeX note that is on [1,kgk] as corner.pre.
It contains the conventions for corner-quotes, along with some explanation
on the ML/OL language structure that is helpful for understanding them.
I haven't looked over the TeX output yet (because I haven't been to Stanford
today), so there may be some errors. I'll drop by around 2:30. --kk
∂29-Jul-81 1146 FFL
To: JMC, FFL
Ed Levy from the U. of British Columbia called. He is trying to get the
program for the Cognition Conference put together today and needs the title
of your talk. He would like us to phone it to him before 3:45 p.m.
604 228 3292
∂29-Jul-81 1319 FFL
To: JMC, FFL
Colleen Crangle called to inquire about a paper, FORMALIZING KNOWLEDGE
OF PERSONS, which she lent to you. She is wondering if you could return
it to her at the Philosophy Dept. I looked for it in your office but
do not find it.
∂29-Jul-81 1620 Denny Brown <CSD.DBROWN at SU-SCORE> PRC visitor
Date: 29 Jul 1981 1618-PDT
From: Denny Brown <CSD.DBROWN at SU-SCORE>
Stanford-Phone: (415) 497-2274
Subject: PRC visitor
To: jmc at SU-AI, tw at SU-AI, tob at SU-AI, buchanan at SUMEX-AIM,
feigenbaum at SUMEX-AIM, csd.lenat at SU-SCORE, csd.genesereth at SU-SCORE
Prof. Chodorow of the Ginzton Lab is trying to arrange for a visitor from
PRC to visit us. Particulars are:
His name is S.P. Fan. He graduated 30 yrs ago from Stanford in Applied
Physics. Background is hardware. Is becoming interested in AI. He's
attending a seminar at IBM on Future Directions of Information Processing.
He'll be at Stanford some time around 8/10-8/11. He'd like to talk to
somebody for half a day. Chodorow says his English is excellent.
I don't know the schedules for any of you, or whether you will be inclined
to see him. Please respond, even if you don't want to see him, so I can
get back to Chodorow. For more info, heaven forbid, Chodorow's extension
is 7-0201.
-Denny
-------
I met Fan in Peking and would be glad to see him again. I don't know about
half a day.
∂30-Jul-81 0814 BLEDSOE at SRI-AI Re: visit
Date: 30 Jul 1981 0812-PDT
From: BLEDSOE at SRI-AI
Subject: Re: visit
To: JMC at SU-AI
In-Reply-To: Your message of 29-Jul-81 1545-PDT
John, I didn't see you message until this morning. I'd be delighted to
see you today. Tomorrow morning would also be posible but today is
better. Anytime. Woody
-------
∂30-Jul-81 1300 JMC*
book
∂30-Jul-81 1608 FFL
To: JMC, FFL
Les Dugan called. He will be in his office the rest of the afternoon.
55 495 5669.
∂31-Jul-81 1142 FFL
To: JMC, FFL
Ron Record from NASA in Mt. View of the Navigation and Guidance section
working on interface via touch and voice, would like to speak with you
and see the lab with some of his people. They have been referred to you
to ascertain general trends so they may anticipate them in their work.
He would like a call. 9 965 5434.
Chuck Jackson is his boss. Referred him to TOB.
∂01-Aug-81 0053 Jerry E. Pournelle <POURNE at MIT-MC> Helping the Boss
Date: 1 August 1981 03:45-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: Helping the Boss
To: POURNE at MIT-MC
cc: LAUREN at MIT-MC, ELLEN at MIT-MC, MCLURE at MIT-MC,
LYNCH at MIT-MC, YORK.MULTICS at MIT-MC, JRDAVIS.MULTICS at MIT-MC,
AV at MIT-MC, POURNELLE at MIT-MC, OAF at MIT-MC, CENT at MIT-MC,
STEF at MIT-MC, JMC at MIT-MC, GEOFF at MIT-MC, JNC at MIT-MC,
PDL at MIT-MC, CBF at MIT-MC, DLW at MIT-MC, RWK at MIT-MC,
MINSKY at MIT-MC, TAW at MIT-AI
Wandering the halls of Captiol Hill, I find that a good
electronic mail and reportage system with file handling would be
of great use; it might even streamline some of what they're
doing over there.
But the "only secretaries use those things" problem
remains.
One Congrewsional Committee bought a laxan word
processor--and they get good use out of it--but they keep it in
a CLOSET of all thngs, and it is connected only to itself. And
it has a criminal operating system.
White House hasn't improved much, either.
Siome day we'll get government into the 1970's?
∂01-Aug-81 0121 V. Ellen Golden <ELLEN at MIT-MC> Helping the Boss
Date: 1 August 1981 04:19-EDT
From: V. Ellen Golden <ELLEN at MIT-MC>
Subject: Helping the Boss
To: POURNE at MIT-MC
cc: LAUREN at MIT-MC, ELLEN at MIT-MC, MCLURE at MIT-MC,
LYNCH at MIT-MC, YORK.MULTICS at MIT-MC, JRDAVIS.MULTICS at MIT-MC,
AV at MIT-MC, POURNELLE at MIT-MC, OAF at MIT-MC, CENT at MIT-MC,
STEF at MIT-MC, JMC at MIT-MC, GEOFF at MIT-MC, JNC at MIT-MC,
PDL at MIT-MC, CBF at MIT-MC, DLW at MIT-MC, RWK at MIT-MC,
MINSKY at MIT-MC, GZ at MIT-MC, TAW at MIT-AI
I am not surprised that word processing is not yet "out of the closet"
on Capitol Hill... to begin with, secretaries and stenographers have a
hard time these days. The people who should be becoming the word
processor aficionados are the stenographers, the "secretaries" should
be becoming the "hackers", and the congressmen should be learning to
read their mail ... but KEYBOARDS are a problem.
I still find that "a secretary is someone whose fingers terminate in
typewriter keys" in the eyes of many many people. Even when you
haven't been a secretary for 5 years, you still get treated like one,
if people remember that... and being treated like a secretary means
"treated like a sub-human species". Here speaks someone who knows.
Not everyone treats me this way, of course, but I still get it, and I
also sympathise with the poor secretaries who get it ... and knowing
them personally as I do, I know that they are not "sub-human".
Operating a Keyboard (terminals do look like typewriters, but the
other sorts of input devices, "joy sticks", "mice", and such, do not
seem from reports to be really efficient or easy to use...) is
necessary for using a computer. This may change (but please not that
dreadful voice from that awful program, (The Star Lost?) ...."May I be
of Assistance?" (said by the computer)).
One day enough people will have had experience with computers, just as
a generation ago people found out that you needed to know how to
drive, that cars were the coming thing. Well, just about everyone learns
how to drive before they graduate from high school these days, so soon
probably everybody will know how to program and consider using a computer
"normal"... then it will be easy to get systems into Congress and other
places... of course the Royal Family in England may have some trouble...
they still use Horses and Carriages.
∂01-Aug-81 0207 STEF at DARCOM-KA Re: Helping the Boss
Date: 1 Aug 1981 0200-PDT
Sender: STEF at DARCOM-KA
Subject: Re: Helping the Boss
From: STEF at DARCOM-KA
To: ELLEN at MIT-MC
Cc: POURNE at MIT-MC, LAUREN at MIT-MC, MCLURE at MIT-MC,
Cc: LYNCH at MIT-MC, YORK.MULTICS at MIT-MC,
Cc: JRDAVIS.MULTICS at MIT-MC, AV at MIT-MC,
Cc: POURNELLE at MIT-MC, OAF at MIT-MC, CENT at MIT-MC,
Cc: STEF at MIT-MC, JMC at MIT-MC, GEOFF at MIT-MC,
Cc: JNC at MIT-MC, PDL at MIT-MC, CBF at MIT-MC, DLW at MIT-MC,
Cc: RWK at MIT-MC, MINSKY at MIT-MC, GZ at MIT-MC,
Cc: TAW at MIT-AI
Message-ID: <[DARCOM-KA] 1-Aug-81 02:00:09.STEF>
In-Reply-To: Your message of 1 August 1981 04:19-EDT
I have yet to see anyone refuse to type enough to use a terminal for
handling computer mail as long as the user can see how it will be
productive. At the very worst, they assign someone to operate the
terminal for them, but they still take advantage from it.
I have introduced these tools to high level executives with considerable
success, though I cannot claim with assurance that I could do so with
the case that Jerry has vaguely identified.
What I suspect is that these folks have not yet been exposed to the
tools in a way that will let them see the benefits to be gained.
From all that they have seen of computers and data processing, they are
probably correct in their assessments. If typical, they are still
bleeding from their last encounter.
Best - Stef
∂01-Aug-81 0214 V. Ellen Golden <ELLEN at MIT-MC> Re: Helping the Boss
Date: 1 August 1981 05:11-EDT
From: V. Ellen Golden <ELLEN at MIT-MC>
Subject: Re: Helping the Boss
To: STEF at DARCOM-KA
cc: ELLEN at MIT-MC, POURNE at MIT-MC, LAUREN at MIT-MC,
MCLURE at MIT-MC, LYNCH at MIT-MC, YORK.MULTICS at MIT-MC,
JRDAVIS.MULTICS at MIT-MC, AV at MIT-MC, POURNELLE at MIT-MC,
OAF at MIT-MC, CENT at MIT-MC, STEF at MIT-MC, JMC at MIT-MC,
GEOFF at MIT-MC, JNC at MIT-MC, PDL at MIT-MC, CBF at MIT-MC,
DLW at MIT-MC, RWK at MIT-MC, MINSKY at MIT-MC, GZ at MIT-MC,
TAW at MIT-AI
The Headquarters of the MIT Laboratory for Computer Science is just
such a place as you appear to describe... "yes everybody has a
mailbox" and indeed someone (he is male) prints out everybodies mail
each day, and makes such replies as they deign to make... (for them)
quite the opposite sort of behavior of most users of computer mail,
especially when the queries are the sort of things which can be
answered easily. In fact, great complaints arise in the "on-line
community" due to the LACK OF RESPONSE from this "use of computer
mail"... I think it is not correct to call this particular activity
"using a keyboard" or "using computer mail"... the individual to whom
the mail is addressed is not a member of the community of
on-line-users in spite of his or her having an account, a password, a
login-name, and a mail-box the contents of which he or she reads every
day.
∂01-Aug-81 0842 JRA
any notion of who i could contact in japan about lisp on personal machines?
∂01-Aug-81 1049 CLT
If you go out today, could you try to find a Saturday(weekend?) version
of the local newspaper (Penninsula Times?), please? Thanks
∂02-Aug-81 0144 Jerry E. Pournelle <POURNE at MIT-MC> NEW CONFERENCE
Date: 2 August 1981 04:43-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: NEW CONFERENCE
To: LLW at SU-AI, JMC at SU-AI
Following documents should be self-explanatory. You will receive
invtations shortly. If you have suggested additions to LIST,
please advise.
.F1 m10 l75 h11 s1 g58 n1 i0
.C
|ANNOUNCEMENT OF SECOND COUNCIL MEETING
.c
|COUNCIL PURPOSE
The Citizens Council on National Space Policy is a private
advisory group. It is supported in part by grants from the American
Astronautical Society, the L-5 Society, and The Vaughn Foundation, but
is independent of all those groups. The Council reports to key staff
within the White House and Congress and thus offers an opportunity to
be persuasive at a level where persuasion can be effective.
|City:| Los Angeles, California
|Date:| Noon, Thursday, 24 September, through Sunday P.M., 27
September, 1981. NOTE: meeting schedule at request of Dr. Hans Mark,
Deputy Administrator of NASA, who may be unable to attend Saturday and
Sunday. Conference papers will, as before, be in semi-final draft
Sunday P.M.
|Fee:| $150 (includes meals; waivers available; see below).
|Location:| 3961 Vanalden Avenue, Tarzana, CA 91356. This is the home
of Marilyn and Larry Niven. The (unlisted) telephone number there is
213-996-6795.
.c
|CONFERENCE AGENDA
1. The Congressional Space Caucus has requested a detailed
space plan which can be introduced as legislation. The plan should
include: what is to be done; when; at what cost; what are the
benefits; when these benefits accrue.
2. White House and Congressional staff have requested
information on space and military strategy, with attention to the
MX/Minuteman problem. Specifically: can forseeable and affordable
space systems help assure the survival of the United States and
preserve Presidential options?
3. The First Council Report has received wide attention and
respect. Revisions to that document will be made as required, with
particular attention to inter-orbital transportation systems.
The first Report was circulated in memorandum format and has
been read in the White House, NASA, and Congress. The Report is now
printed and bound, and is available from:
The L-5 Society
1060 E. Elm St.
Tucson, Arizona 85719 at $5.00 per copy postpaid. You
are urged to buy copies of the report and circulate them within your
organization.CITIZENS ADVISORY COUNCIL -- Second Meeting Announcement
-- ; Page Two
.c
|ADMINISTRATIVE CONSIDERATIONS:
Security and Classification: The Conference is UNCLASSIFIED.
Persons WITHOUT current security clearances WILL be present, and the
conference site is NOT a cleared facility. Our friends in Congress
and elsewhere believe that the U.S. public must become more closely
involved in strategic and space matters; and that this cannot happen
when the most important policy papers remain secret.
However, for those with relevant interest, clearance, and
need-to-know, cleared facilities can be made available. If there is
any likelihood of your requiring a classified discussion, it might be
well to have your clearance on file. Please have your security
officer send relevant clearance documents to:
Dr. Francis X. Kane, Director of Plans
Bldg. E2 Room 5080
TRW
1 Space Park
Redondo Beach, California, 90278
Council Fees:
The Council Fee is $150 for those arriving Thursday or Friday,
and $100 for those arriving Saturday. These fees can be waived in
certain cases; please inquire. The fee includes three working lunches
and two working dinners, plus refreshments and a symposium following
the working dinner Saturday night. Make checks payable to SPACE
COUNCIL FUND OF THE L-5 SOCIETY and send to Chairman at above address.
Writers:
Several leading science fact/fiction writers will attend the
conference and one or more will be assigned to each committee meeting.
Those attending the first Council Meeting will recall that this
practice was highly successful. The writers were able to make
non-trivial contributions to the discussions, and also produced
interesting and readable reports in a surprisingly brief time.
Equipment available:
Copy machine; 4 Selectric typewriters; 2 word processor
computers; at least one technical typist; large sheets of paper and
marker pens in lieu of blackboards; vu-graph and 35 mm (carousal)
slide projector; Beta-max format TV tape recorder/player. If anyone
requires other equipment, please inform Dr. Pournelle immediately.
Anyone possessing a portable word processor is urged to bring it.
Local Transportation:
Tarzana is located approximately 25 miles due north of
LA International Airport and is reached via Interstate-5, then West
(toward Ventura) on the Ventura Freeway to the Tampa Avenue off ramp,
South (under the freeway) to Ventura Ave. Vanalden Avenue goes South
off Ventura Avenue one major block East (back toward Los Angeles) of
Tampa. CITIZENS ADVISORY COUNCIL -- Second Meeting Announcement -- ;
Page Three
.c
Administrative Considerations, Continued:
|THERE IS NO RELIABLE PUBLIC TRANSPORTATION IN LOS ANGELES.|
Conference attendees are responsible for their own transportation, but
volunteers are available to drive those without rental cars or other
local transportation. Please inform Dr. Pournelle.
Tarzana is north of the Santa Monica Mountains, and is more conveniently reached via Hollywood-Burbank Airport than LAX. (Unfortunately, most attendees will have to come in via LAX; but PSA and Continental do fly into Burbank from California and other Western cities.) Tarzana is approximately 20 miles west of Burbank, via the Ventura Freeway (westbound, toward Ventura). The Ventura Freeway is about 2 miles south of the Burbank Airport.
Accommodations:
The Chalet Lodge Motel, 19170 Ventura, Tarzana, CA 91356,
213-345-9410 is conveniently located very near Vanalden and Ventura
(about one mile north of the Niven home). It is AAA approved, and
accepts most major credit cards. Rates (this conference only) are $35
single and $40 double (per night). |Attendees are responsible for
their own reservations, which should be made one week in advance.
Meals: Buffet-style meals served while work continues were highly
successful at the first Council Meeting, and the practice will be
continued. Meals served will be: Lunches on Friday, Saturday, and
Sunday; Dinners on Friday and Saturdays. Coffee and other such
necessities will be continually available throughout the conference.
Social Activities:
There will be a working symposium (the original Greek
symposium was a group discussion held around a large bowl of strong
wine) Friday and Saturday evenings. The Nivens have graciously
offered use of their swimming pool, sauna, and jacuzzi spa throughout
the conference. No other social events are planned. |Due to limited
space, we do NOT encourage anyone--spouses, friends, or
companions--not participating in the conference to be present at the
Niven home during the conference, as there will be little for them to
do.| Los Angeles has many attractions, but conference activities
preclude attendees from experiencing them during the conference
weekend--and there are few attractions in or within walking distance
of Tarzana.
Invitation Policy:
Attendance at Council Meetings is by invitation only, and
Council invitations are not automatically transferable. However, if
you have suggestions for substitutions or additions to the Council,
please inform the Chairman. The Council is intended to be broadly
representative of those interested in US Space Policy, and seeks a
wide spectrum of views and opinions on what that policy should be.
Please respond to your invitation in a timely manner. A
large number of firms and individuals wish to attend, and not all can
be accommodated..F1 m10 l75 h11 s1 g58 n1 i0
.C
|INVITATION LIST -- SECOND MEETING
Note: some of those invited will probably be unable to attend.
All have expressed interest in the Council Meetings, and will receive
draft copies of the reports. Most are expected to attend.
Suggested additions to this list should be referred to the
Chairman. Please do NOT extend invitations without notifying the
Chairman.
The Council is an independent private advisory group, and its
conclusions and recommendations are not necessarily representative of
or approved by any firm, company, or organization. Public officials
attend as observers only and should not be considered necessarily to
approve or be responsible for Council conclusions.
Poul Anderson Mark M. Hopkins
Dr. Gregory Benford Robert A. Heinlein
Dr. B. J. Bluth Barbara Marx Hubbard
George V. Butler Gary C. Hudson
Randy Clamons Dr. Rod Hyde
Gerald P. Carr Dr. Michael Hyson
Dr. Francis X. Kane
Dr. Philip K. Chapman Dr. Hans Mark
Gordon Cooper Dr. John McCarthy
G. B. Merrick
Dr. Marvin Minsky
Dr. David Criswell Larry Niven
Scott Crossfield Fred Osborne
Konrad K. Dannenberg Dr. Thomas O. Paine
Hugh Davis Dr. Stefan Possony
Eric Drexler Dr. Jerry Pournelle
Gerald Driggers James Ransom
Art Dula Dr. Robert Salkeld
Dr. Freeman Dyson Walter Schirra
Congressman Newt Gingrich Dr. Charles Sheffield
Stephen Goldin BJO Trimble
Congressman Barry M. Goldwater, Jr. James M. Vaughn, Jr.
Dr. Charles L. Gould Gordon R. Woodcock
Lt. Gen. Daniel O. Graham Dr. J. Peter Vajk
Dr. Lowell Wood
∂03-Aug-81 0817 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) boxes on fifth floor
Date: 3 Aug 1981 0816-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: boxes on fifth floor
To: JMC at SU-AI, ffl at SU-AI
John,
The main reason I haven't had any boxes delivered to you is that John,
the student helper, is not working this summer. Do you want to go to
the fifth floor and look through the remainder of your boxes (about 30
I think) or do you want me to get someone to deliver them to your office?
Carolyn
-------
∂03-Aug-81 1512 Mark Crispin <Admin.MRC at SU-SCORE> Re: loglisp
Date: 3 Aug 1981 1510-PDT
From: Mark Crispin <Admin.MRC at SU-SCORE>
Postal-Address: 12155 Edgecliff Place; Los Altos Hills, CA 94022
Stanford-Phone: (415) 497-1407
Subject: Re: loglisp
To: CSD.MCCARTHY at SU-SCORE
In-Reply-To: Your message of 3-Aug-81 1459-PDT
It is a bug in LISP.EXE on MRC:<LOGLSP.LISP> that causes the
? PA1050: ILLEGAL INSTRUCTION 0,,0 AT USER 400010
This message is equivalent to the Illegal UUO message generated
by WAITS. PA1050 is the user process which emulates TOPS-10
system calls (UUOs) on TOPS-10; evidentally this version of LISP
was intended to run on TOPS-10.
TOPS-10 sites are limited to six characters as WAITS is, which
probably explains "LISP" and "LOGLSP". Renaming the directories
is rather painful; I'd rather find another home for these files
than the MRC: disk (MRC: is a system programming disk pack which
is often very low on space).
-------
∂03-Aug-81 1517 Mark Crispin <Admin.MRC at SU-SCORE> more on LOGLSP
Date: 3 Aug 1981 1514-PDT
From: Mark Crispin <Admin.MRC at SU-SCORE>
Postal-Address: 12155 Edgecliff Place; Los Altos Hills, CA 94022
Stanford-Phone: (415) 497-1407
Subject: more on LOGLSP
To: CSD.MCCARTHY at SU-SCORE
It seems that GET MRC:<LOGLSP.LISP>LISP followed by START 400010 gets
you into a LISP environment. I'm afraid the problem is that it is
doing something cute with memory management on TOPS-10 that cannot
be simulated on TOPS-20.
-------
∂03-Aug-81 1521 Konolige at SRI-AI S+P
Date: 3 Aug 1981 1522-PDT
From: Konolige at SRI-AI
Subject: S+P
To: bledsoe
cc: jmc at SAIL, bledsoe at UTEXAS-20
Woody, I worked out the subproblem that you set up for the S+P
problem, but without having to use a circumscription schema. I now
believe that I could solve the entire problem in my formalism without
using any circumscription at all. If you want to look at it, a statement
of the problem and a hand proof are on <KONOLIGE.PROVE>SP.NOTE.
--kk
-------
∂04-Aug-81 0103 JK a new EKL
To: JMC, JMM, FGA, JJW
A new EKL with variable typing and default declarations
is up: The internal forms of old proofs will not work anymore -
by editing the pretty-printed versions of proofs one can form
command files and re-execute the proof using DSKIN.
I re-did the proof of Ramsey's theorem in the new system:
I deleted all the declarations except the ones involvinf infix
operators. The new proof can be found in ramse1.txt[ekl,jk].
A brief outline of the changes can be found in ekl.new[ekl,jk].
EKL.MAN[EKL,JK] is up to date and has a few examples.
∂04-Aug-81 0117 POURNE@MIT-MC (Sent by COMSAT@MIT-MC)
From: POURNE@MIT-MC (Sent by COMSAT@MIT-MC)
Date: 08/04/81 04:00:11
POURNE@MIT-MC (Sent by COMSAT@MIT-MC) 08/04/81 04:00:11
To: JMC at MIT-MC
[COMSAT: This was a failing QSEND.]
POURNE@MIT-MC 08/04/81 03:59:39
Coming to the conference?
Certainly. I'll miss Sunday, that's all.
∂04-Aug-81 0141 TOB Martin Marietta
John
I am available at 2pm.
Let me know.
Tom
∂04-Aug-81 0138 JMC Meeting with Martin Marietta that may be worth a grant
Are you available tomorrow at 1 or 2 for this purpose?
∂04-Aug-81 0156 TOB ok
John: OK. Tom
∂04-Aug-81 0143 JMC
OK, my office
∂04-Aug-81 0849 Robert Elton Maas <REM at MIT-MC> Teller's recent book ''Energy from Heaven and Earth''
Date: 4 August 1981 11:14-EDT
From: Robert Elton Maas <REM at MIT-MC>
Subject: Teller's recent book "Energy from Heaven and Earth"
To: JMC at SU-AI
Is this book worth reading for ideas on space energy&industry development?
Does it contain any ideas not familar already to L-5 people?
I don't recall whether it even mentions solar power satellites; it certainly
doesn't emphasize it.
∂04-Aug-81 0947 FFL
To: JMC, FFL
If he did not reach you at home, please call Mr. Fenaughty.
213 390 86ll.
∂04-Aug-81 0956 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Manual of Style
Date: 4 Aug 1981 0954-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Manual of Style
To: CSD-Faculty:
cc: TOB at SU-AI
We now have a copy of the Chicago "Manual of Style" for reference in
my office.
Carolyn
-------
∂04-Aug-81 1255 CSD.GENESERETH at SU-SCORE MRS paper
Date: 4 Aug 1981 1251-PDT
From: CSD.GENESERETH at SU-SCORE
Subject: MRS paper
To: jmc at SU-AI
I have left a draft of the official paper on MRS, the "multiple
representation system" I told you about a while back. In many ways
it's reminiscent of FOL, but there's a different emphasis and some
new directions. I'd appreciate your comments.
mrg
-------
Surely you will be criticized for not calling it MS.
∂04-Aug-81 2235 LLW Tomorrow
To: JMC
CC: LLW
John, when should we look for you tomorrow? Lowell
∂05-Aug-81 0206 LLW Visit Scheduling
To: JMC
CC: LLW, CEG
∂05-Aug-81 0203 LLW Visit Scheduling
To: JMC
CC: LLW, CEG
∂04-Aug-81 2340 JMC
I'll come at 2pm unless I hear otherwise from you.
[John: How about 2, or as soon after lunch as possible. I'll be around
from noon on. Lowell]
∂05-Aug-81 0747 REG
To: JMC at SU-AI
CC: Admin.Mrc at SU-SCORE
∂03-Aug-81 1503 CSD.MCCARTHY at SU-SCORE loglisp
Date: 3 Aug 1981 1459-PDT
From: CSD.MCCARTHY at SU-SCORE
Subject: loglisp
To: admin.mrc at SU-SCORE
cc: admin.gorin at SU-SCORE
The system command
mrc:<loglsp.lisp>lisp
elicits the reply
? PA1050: ILLEGAL INSTRUCTION 0,,0 AT USER 400010
Incidentally, would it be two much trouble to rename the directory
mrc:<loglisp.lisp>lisp. It is anomalous that one spells out "lisp"
in one part of the name and abbreviates it "lsp" in another part of
the same name. Or is that something that Syracuse did? Does the
illegal instruction message mean a missing file?
-------
I think the directory name must be my mistake. In any case,
directory access is made much easier by the use of logical names.
A logical name can be thought of a prefix to a file name.
Subsequent to the command
@Define Lisp: MRC:<Loglsp.lisp>Lisp.Exe
you may use the logical name LISP: to refer to the file, and
thus, the command
@LISP:
will have the effect as the command
@MRC:<Loglsp.lisp>lisp
The Define command may be placed in your LOGIN.CMD file.
The illegal instruction message results from the fact that
the upper segment of the program, although present in the
EXE file, disappears shortly after the program is started.
I have not had an opportunity to examine the problem thoroughly.
It seemed on my first examination to be somewhat impervious to DDT.
∂05-Aug-81 1139 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Mike Farmwald
Date: 5 Aug 1981 1135-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Mike Farmwald
To: JMC at SU-AI
Mike Farmwald said he gave an AI Seminar spring of 77/78.
Can you confirm that he did so and that it met the PHD oral requirement?
Very important.
Carolyn
-------
Yes he did give a seminar and it did meet the requirement.
∂05-Aug-81 1321 FFL
To: JMC at SU-AI, CET at SU-AI, FFL at SU-AI
Richard Weyhrauch called in to say that he has been ill since Monday and
probably would be dthe rest of the week recovering. He wanted me to give
both of you this message.
∂05-Aug-81 1618 JMM append proof
To: JMC
CC: JMM
I think that the algebraic substitution kind of an approach would
work much better under the following setup:
Split up proving property into two stages
1) partial correctness: for this an `approximate theory' of sexps can
be used ie correct except for the possibility of `undefined'.Then one can
do away completely with sorts.Most of the work in the proof seems to be
in checking for things like whether you are taking the car of a pair
or just a sexp-in the latter case there is a risk of it returning`undefined'.
The suggested approach is to work recklessly-the only risk is that at
the end the actual result might be `undefined' instead of what has been
obtained.
2)termination:for this one can either use termination on form arguments
or go over the whole proof again-this time concerned only with termination.
This proof will be quite simple too.
The major argument against this approach is the loss of mathematical
elegance in not being able to do the whole thing at once.However this leads
to more complicated axioms and proof steps-a burden for the uninitiated.
I would like to know your views,suggestions etc on this approach.The
reason why I am veering towards this hack is that in the proof of append most
of the proof steps seem to be this bookkeeping sort-while conceptually the
proof is only a five-line proof these take most of the time.
Jitendra Malik
Let's talk about it, but in the meantime, you should prepare versions doing
it both ways. My intuition is that one should be able to have the best of
both worlds - get both from one proof and make the simplification rules do
the verifying.
It might be best to do the proof of termination first and then use this
to validate a reinterpretation or slight transformation of the function
definition so that it is assumed to be total.
∂06-Aug-81 0832 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Date: 6 Aug 1981 0829-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
To: JMC at SU-AI
cc: PMF at SU-AI
In-Reply-To: Your message of 5-Aug-81 1941-PDT
Thanks, John.
Ok, Mike, it's up to you. Good luck.
Carolyn
-------
∂06-Aug-81 0916 RPG
To: DDY at SU-AI, CET at SU-AI, JMC at SU-AI
∂05-Aug-81 0754 DDY thesis
Your thesis will not have an AIM # after all. Since the dissolution of the AI Lab,
this is the first report about which the question has arisen. Carolyn asked John
McCarthy whether he wished to continue the AIM series of #'s and who would handle
it if so. John's reply was that we discontinue the series. Dawn
I feel cheated. I did all my research at the AI Lab and DO NOT feel that th
department was relevant to anything I did in that respect. I would have
thought that the people who are in this position (having been AI Lab people)
would have the opportunity to be in the AIM series.
Dawn:
If you have not sent out the report to the printer, please hold off for a
while: I want to see if Cordell Green can publish the report at SCI and
then I can forget Stanford publications altogether.
John:
This may not seem important to you, but it is to me, Rod Brooks, and
Paul Martin.
-rpg-
Since the issue is important to some people, let me reverse my decision.
We'll continue AI memo numbers for at least another year. Fran will
assign them.
∂06-Aug-81 1213 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Date: 6 Aug 1981 1210-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
To: RPG at SU-AI, DDY at SU-AI, CET at SU-AI, JMC at SU-AI
In-Reply-To: Your message of 6-Aug-81 0916-PDT
John McCarthy made the decision this morning that AIM numbers will be
continued. He will designate someone in his group to control the number
assignments.
Carolyn
-------
∂06-Aug-81 2034 TOB
Thanks, John
Tom
∂06-Aug-81 1614 JMC adjunct
It seems to have fallen into a crack between Ullman and Golub, but
Golub now promises to find out its state and pursue it.
∂07-Aug-81 0848 Vaughan Pratt <CSD.PRATT at SU-SCORE> Sun meeting
Date: 7 Aug 1981 0847-PDT
From: Vaughan Pratt <CSD.PRATT at SU-SCORE>
Subject: Sun meeting
To: @sun at SU-AI
The Sun meeting has been postponed to Tuesday August 11, 2 pm, MJH 252.
Agenda
1. Announcement of manufacturing agreements for the Sun workstation
concluded with Cadlink, including delivery schedule and cost to Stanford.
2. Presentation of a document sketching extant and contemplated
Sun software. I hope to use the meeting to get some feedback on priorities
for the contemplated software.
-------
∂07-Aug-81 1030 Paul Martin <PMARTIN at SRI-AI>
Date: 7 Aug 1981 1022-PDT
From: Paul Martin <PMARTIN at SRI-AI>
To: JMC at SU-AI
In-Reply-To: Your message of 6-Aug-81 1040-PDT
Thanx..Paul
-------
∂07-Aug-81 1239 Darden at SUMEX-AIM paper for Steve Stich
Date: 7 Aug 1981 1236-PDT
From: Darden at SUMEX-AIM
Subject: paper for Steve Stich
To: JMC at SU-AI
cc: Darden at SUMEX-AIM
Hi, John, Steve Stich called today to say he had received a vague rumor
that you might send a paper to him over the network, via me. Since I
just got a new printer, that would have been possible today; but since
I am leaving for two weeks starting tomorrow (is this beginning to sound
like your illustration of non-monotonic logic?) that won't be possible
starting tomorrow morning. Good luck in getting the paper off.
I've been thinking about constraints in theory construction lately
and reading AI literature to see whether the term is used similarly
to the way philosphers of science use it: as might be expected, it
has a tighter more formal meaning in AI, but some similarities persist.
I'm also looking for analogies in control structures in computer
programs that might be useful in forming hypotheses about how genes
control each other. Any suggestions?
I'll be checking my msgs from Harvard next week.
I hope your summer is going well; any Washington plans?
Bye, Lindley
-------
∂08-Aug-81 0254 JMM associativity of append
To: JMC, JK
CC: JMM
The proof of assoc of apppend using the approach suggested by Carolyn
is ready - prf3.ppr[ekl,jmm]. It is 55 lines of which the first 30 lines
are general declarations and axioms etc and 25 lines are specific to
append .This proof did not use the more powerful commands like DECSIMP
and can be tightened to about 15 lines( I think !)
-- Jitendra
Please look at his proof. Even 15 lines looks like too much, and I
think you can easily make suggestions either for improving the proof
or EKL.
∂08-Aug-81 1644 CLT JMM etc.
I'll talk to Jussi on Monday.
I don't know EKL and don't want to spend a lot of time figuring out
JMMs proof, but together Jussi and I should be able to come up
with an acceptable proof.
∂08-Aug-81 1656 CLT
∂08-Aug-81 1649 JMC
OK, though I think you'd find what JMM has done transparent.
Possibly transparent, but probably not very informative as to
what is really possible in EKL
∂08-Aug-81 1744 RGUEST at UTAH-20 my visit/lisp history
Date: 8 Aug 1981 1837-MDT
From: RGUEST at UTAH-20
Subject: my visit/lisp history
To: jmc at SU-AI
dear john mccarthy!i'm looking forward to our meeting at stanford.may be
john allen will be accessible .do you think that the dan j.edwards at
usc/isi is the one that worked at mit some years ago?do i have time to go
to xerox?i'm very happy to be here.thank you for your help.herbert stoyan
-------
To Herbert Stoyan:
What dates do you have in mind for Stanford visit? I'll be gone from
August 18 to August 28. John Allen will probably be accessible. Whom
do you wish to visit at Xerox?
∂08-Aug-81 1752 JK
∂08-Aug-81 1751 JMC
I now recall the meeting was in Tampere. Is there such a place?
-----------
Yes - that is in central Finland; one of the main industrial centers.
∂09-Aug-81 0238 TOB gm
GM has sent a letter stating that they are exploring the
establishment of a large, long-term relationship with a
major university or research institute in the area of
robotics, including computer vision, etc. They don't give
much time for a response. I am drafting one now. I will
be away for several days. Are you interested in
commenting on my response. I value your judgment. If you
haven't the time or interest, that's ok. This round
is only to narrow the field, and I think we will get through.
I think that we have a great chance. They will make visits
in September. If you are interested, let me know your thoughts.
Tom
∂09-Aug-81 0246 TOB
∂07-Aug-81 1316 MAS gm
Letter from GM (from Lothar Rossol, 8/7/81)
To: TOB
Reply to: Mr. R.C. Beecher
GM Manufacturing Development
Warren, MI 48090
(mostly in my own words)
Since we expect to make extensive use of robots in the future, we are
exploring the feasibility of a long term relationship with institutions
which do research in sensor-based robots.
The first step would be to select from Universities and Research Institutions
which are in the forefront.
We would like your comments on the criteria (described in the next page)
before August 14. This will possibly be followed up by a visit of GM
people in September.
(Next page, according to LR the answers to the following questions could be
mostly standard, like things you wrote for NSF, etc.)
We would like your comments on the following(areas A, B, C and D):
A. R&D ACTIVITIES
1) Projects in Robotics
Describe current projects (when we say Robotics we include Vision, Force,
Range sensing and the areas of Machine Perception).
2) Research specialties
In what do you excell? What are you good at. Describe.
3) Related research areas. Describe which areas complement your area eg Control
B RESOURCES
1) Personnnel
List them and what % of their time is devoted to Robotics.
2) Facilities
3) Funding. What is the level, from whom and what type.
C ACCOMPLISHMENTS
Describe accomplishments (direct and indirect).
D OTHER CONSIDERATIONS
1) Plans
Long range, what funding, industrial affiliations?
2) History
Previous industrial relations and affiliations.
3) What are your thoughts on building prototypes or production systems.
4) What conditions would you impose on industrial grant. Please discuss
views on patent rights, information dissimination, sabbaticals between
partners, direction of R&D efforts by industrial partner.
(LR:How much direction would be acceptable)
5) What are the normal working relations between you and your ind. affiliates.
Formal or informal. How often? (LR: this question is similar to the
previous one).
6) What areas in R&D in Robotics would you suggest for GM. Describe in
some detail size and scope in terms of manpower and funding.
(In other words: what do you think GM should do in the area of Robotics).
That's it. LR asked to send him a copy of the cover letter or the whole thing
∂09-Aug-81 0247 TOB
\F2\CROBOTICS
\F2\CSTANFORD ARTIFICIAL INTELLIGENCE LABORATORY
\F2\CCOMPUTER SCIENCE DEPARTMENT
\F2\CSTANFORD UNIVERSITY
\F0\CThomas O. Binford
\F0\CThe robotics program at the AI Lab was begun by John McCarthy
in 1965. Dr. Binford has concentrated in robotics for 15 years, at
the AI Lab, MIT, then at the AI Lab, Stanford since 1970.
Research in robotics at the AI Lab includes four major headings:\.
computer vision
manipulation
mobile robots
geometric modeling
\JResearch focuses on two major systems:\.
\jThe AL system for programming robots;\.
\jThe ACRONYM system for spatial reasoning.\.
\JThe focus on building systems has the effect that students
can start immediately at the state of the art; they
don't have to start at ground zero. Projects can be continuous and large,
not limited to a single student project. They provide an experimental system
in which to integrate results in a way that provides increasingly powerful
capability by combining modules. The approach provides a way of testing
the generality of modules by testing them with others in new problems.
These systems provide a means of technology transfer. An important
problem of utilizing technology is providing total system integration.
We have focussed on important applications to find fundamental
problems whose solutions would provide breakthroughs in these applications.
One part of the effort is problem-solving, another is problem-finding.
In problem-solving, we find general, theoretical mechanisms to solve
the central problems, implement these mechanisms in software and hardware,
integrate the mechanisms in systems like AL, and analyze performance.
In problem-finding, we analyze applications, analyze robotics capabilities,
identify fundamental problems, formalize these problems, and explore
theoretical and practical performance limitations.
Thus, there is a combined implementation and theory focus.
This is a large program with continuously about 22 people involved.
\F0\CProjects
\JManipulator design: Currently we are collaborating with
Prof Bernard Roth, Mechanical Engineering Dept, and with Carl Ruoff, JPL,
on design and control of a three-finger hand with nine degrees of freedom,
a "universal gripper". The
motivation for the hand is to provide fine control of forces in assembly
and tool using, and to provide the relevant degrees of freedom for repositioning
objects after grasping for subsequent assembly operations. This is a research effort;
we expect that further effort will be necessary to make a
rugged and reliable hand that can be used in everyday work.
Conceptual design including theoretical work, and detailed design are complete.
The fabrication of the hand is just beginning.
Work in optimizing the design of the hand has resulted in
significant theoretical contributions [Salisbury 81].
Sensory Technology: Historically, we have done considerable work in
technology for force and contact sensing resulting in the
Scheinman force sensing wrist [Binford 72; Scheinman 74].
We are about to begin new work in collaboraton with Prof Larry Leifer of
Mechanical Engineering, Prof Robert Cannon of Aeronautics and Astronautics,
and Prof John Shaw of Applied Physics on contact sensors using piezoelectric
polymers and array techniques. We also plan to make integrated circuit
versions of sensor interfaces for strain gage sensors for the Scheinman
force sensing wrist, using capabilities of the Integrated Circuits lab,
Department of Electric Engineering. We are currently designing force-sensing
fingers to complement force sensing wrists, to provide greater sensitivity
to small forces, and to minimize the mass between sensor and load to minimize
inertial forces caused by accelerations.
PUMA consortium: We have organized a consortium of users of the Unimate PUMA
to instrument the PUMA robots. Stanford is taking the lead in providing
resources for a pooled effort to provide: electric hands with two fingers;
wrist force sensors; and finger sensors. A hand is about to be fabricated
at Stanford. Current plans call for use of the GM design for a wrist force
sensor, to those institutions to whom GM will release the design. Detailed
plans and schedules are available on request. The effort will have the benefit
of providing common equipment and pooling effort while saving cost.
The hand to be used is not the same as the three-finger hand which was described
above. For the consortium, a conservative design with two degrees of freedom
is being made. It will be modified to a three finger version with three
degrees of freedom.
Force control and programmable compliance: Stanford has completed a
general and powerful analytic method for force control of robots
providing programmable compliance for assembly operations. The mechanism
has been implemented in the AL system and has been tested in experiments
over several years. Studies are underway on fundamental theoretical
limits to force control in exerting small, controlled forces; these studies
will influence control and strategies
for force control, and will lead to studies of design of manipulators for
sensitive force control.
Dynamics and control: We collaborate with the control group of the
Department of Aeronautics and Astronautics (Prof Robert Cannon and
Prof Dan Debra, with some consulting by Prof Art Bryson) on a number of important
problems in dynamics and control of robots. Impressive resuls have been
obtained in high speed slewing of flexible manipulators.
We are investigating
problems of end point sensing, tracking, load estimation, flexibility, making use of
contact sensing, closed loop kinematic chains including two cooperating manipulators
and three finger hands; and
non-collocated sensor and actuators.
These efforts bring modern control theory to bear on deep problems which come
from making efficient use of robots by running them at high speeds rather than
degrading their performance by slowing them down, and problems which arise in
using sensing.
Programming Systems for robots: Stanford completed the AL system for
programming robots. Currently, we are implementing a portable version of
AL in PASCAL for a standalone PDP11 in the RSX11 operating system.
A small subset of AL will also be made available for small computer configurations.
The full system will include an interpreter and source language debugger
with force control, multiple device control, and software servos.
AL currently has all these capabilities.
Plans call for the initial implementation to be finished near the end of the year
and a release version sometime in the next year.
An AL subset has been implemented at Karlsruhe, Germany, and a language closely
patterned after AL has been implemented at the University of Tokyo by Prof Inoue.
A simulator for mechanical systems has been implemented [Soroka 80]. It will
be extended to include dynamics and control. The simulator is written in
ACRONYM and simulates AL language programs.
Studies are underway on analysis of assembly from two standpoints: the first
is to measure times involved in fragments of assembly steps to quantify
systems issues in speeding up assemblies; the second effort is a profound
kinematic analysis of assembly from the standpoint of screw theory
[Ohwovoriole 80] led by Prof Roth.
Work has begun on the next generation of robot programming systems, based
on a study of requirements for: a hierarchy of languages; vision; geometric
modeling; off-line programming; simulation; and planning. The study will
poll industry requirements. ACRONYM provides a good basis for a new design.
Computer Aids to Mechanical Design: A proposal is in preparation for a
collaboration with Prof Roth of Mechanical Engineering for Computer Aids
to Mechanical Design. This project intends to use current work in geometric
modeling and geometric reasoning as the basis for a system to aid in
creative aspects of design. Current CAD systems tend to be drafting systems;
they aid in the display and bookkeeping, i.e. the routine parts of design.
Mobile robots: In collaboration with Prof Leifer of Mechanical Engineering
and Unimation, Inc, we will continue research in mobile robots [Moravec 80].
This effort is intended to lead to a product as one of the results.
A new vehicle has
been built. Stanford will do the navigation, control, and perception.
Stanford has demonstrated navigation of a robot cart in semi-realistic
environments, mapping its world by stereo perception, and planning paths
around obstacles determined by vision.
\F2\CVISION PROJECTS
\F0\JIntermediate Level Vision System: We think that current industrial
vision systems have weak capabilities that limit the number of applications
that they can accomplish, and which necessitate extensive engineering for
those applications for which they are adequate.
Industrial vision systems use thresholding to get binary pictures, and use
simple shape descriptors for two-dimensional images and models.
A part of our work is directed toward grey-scale edge-based techniques with
effective shape descriptors which can be implemented with currently available
hardware at reasonable cost.
VLSI implementation of vision operators: A single element of an array
of processors has been fabricated, tested, and found to be correct. The
next step is to make a 10x10 array of processors and then a 100x100 array,
using a fault-tolerant design [Miller 81]. This processor is not the final answer to
high speed vision, but it is one part of the learning process. Two phases
are essential: the first is architecture of vision operations; the second is
VLSI implementation of well-defined operations.
ACRONYM: A powerful system combines geometric modeling
with state-of-the-art problem-solving in the form of geometric reasoning,
and integrated low level visual operations [Brooks 81]. It
is being converted to a VAX in a LISP dialect, and will be included in the
Image Understanding Program Testbed. It will be made available in about 18
months. It is likely to be used by several defense contractors on DOD contracts.
The system will be pushed forward extensively in the next few years.
It is the underlying system for a sophisticated stereo effort for DMA, for
programmable inspection, for planning, for the next generation of programming languages,
and more. For example, a program for picking grasping points of objects was
written as a rule base in ACRONYM. All of the work below is or will be integrated
as a part of ACRONYM. ACRONYM is beginning to be applied to one of the
examples of the GM bin of parts series. Our aim is not to duplicate work
of Univ of Rhode Island on bin-picking for simple parts, but to demonstrate
a general model-based system on much harder problems. ACRONYM is a three
dimensional vision system.
Edge finding: Work is underway to develop high performance edge finders
involving simplification of the Binford-Horn edge finder, and with
sophistication to provide higher performance still. Impressive results have
been obtained and rapid progress is being made. These techniques will be
reduced to VLSI by first simplifying the architecture and then implementing
in hardware.
Stereo vision: A proposal has been made to carry out one part of a program
to provide Defense Mapping Agency with a feasibility demonstration system
for automated stereo cartography. Stanford has made extensive progress in
automated stereo; we are in close contact with other organizations doing stereo.
We are evaluating their results and analyzing various contributions.
Our progress is especially rapid now in stereo vision.
Structured Light: We are planning to resume work in structured light,
based on past work. Stanford was one of the originators of the technique in 1970,
along with ETL, Tokyo, and IBM.
Inferring Surfaces from Images: Theoretical work of about two years ago
provides the outline of an incomplete theory for understanding images of
quite general scenes [Binford 81]. The results are surprising powerful and general.
Some results have been implemented in determining a three dimensional model
for an aircraft from a single image, using shadows [Lowe 81]. These results will be
extended greatly. They provide the basis for effective stereo, and for
three dimensional industrial vision and inspection systems.
!\F2\CAREAS OF EXCELLENCE
\F0\JThe robotics program at Stanford has strength in Artificial Intelligence and
computer science, the Design Division of Mechanical Engineering, and the
control group of Aeronautics and Astronautics.
\F0\JSlightly more than half our effort is involved in machine perception.
Stanford is a leader in several areas of machine vision:\.
\j1. ACRONYM hss probably no close rival among machine perception systems
with geometric reasoning and planning.\.
\j2. Edge finding is as advanced as anywhere.\.
\j3. Stereo vision capability is probably the most advanced.\.
\j4. Shape description is the most advanced.\.
\j5. Geometric modeling is among the leaders.\.
\JThe effort in manipulation is augmented by collaboration with other groups.
Stanford is a leader in the following areas:\.
\j1. with IBM in programming systems for robots.\.
\j2. force control integrated in software.\.
\j3. with Purdue in dynamics and control.\.
\j4. with several Japanese groups in manipulator design.\.
\F2\COTHER AREAS
\F0\JStanford also has considerable strength in sensory technology, aided
by collaboration with Applied Physics.
Computer Systems research supports our activity in programming systems.
We collaborate with John Hennesy and others in Electrical Engineering.
Development of computer networks, the SUN terminal and ETHERNET, aid in
developing distributed robotics systems. This includes development of
several high capability graphics elements: one is a VLSI implementation of
a chip for computing homogeneous transforms at high speed; a second is a
highly parallel high speed vector generator for text and graphics.
Still another area of support is a large VLSI effort at Stanford's Center
for Integrated Systems, which will include a fast turnaround fabrication
facility, plus extensive contact with participants in the VLSI industry.
!\F2\CRESOURCES
\F0\CPersonnel
\JThe following faculty and staff work in robotics
Dr. Thomas O. Binford, Computer Science, 100%
Dr. Sidney Liebes, Jr., Computer Science, 100%
Prof. Ram Nevatia, visitor on leave from USC, 100%
Prof Bernard Roth, Mechanical Engineering, 50%
Prof Robert Cannon, Aeronautics and Astronautics, 50%
Mr. Victor Scheinman, Mechanical Engineering, 80%
Prof Larry Leifer, Mechanical Engineering, 80%
Prof Dan DeBra, Aeronautics and Astronautics and Mechanical Eng, 25%
Mr Russ Hacker, Aero and Astro, 20%
1 electronics engineer, Aero and Astro, 20%
We expect to add one or two PhD level researchers in Computer Science to
replace Dr. Barry Soroka who has moved to USC.
Usually there are one to two visitors at the PhD level (we had requests
for nine visitors for the next year).
The group is largely students. The total group in computer science
is about 22, of whom about 15 are students. Most are PhD students,
many of whom have extensive experience in robotics. It is planned
to expand to include MS students, especially as part of a program
MS in CSAI, Computer Science specializing in AI. There are several
more students in Aeronautics and Astronautics and about seven more
students working on robotics for rehabilitation.
\F0\CEquipment
\JThe central computer is a DEC KL-10 time-sharing system with
11 megabytes of memory (36 bit words) and 8 disk drives of 200 megabytes each.
It is combined with a DEC 2060 with 4 megabytes of memory.
We have access to a VAX 11/780 and will be getting a large VAX 11/780
configuration in spring 1982.
There are full graphics display terminals in every office in the laboratory.
Display editors and other system software provide unusual
user facilities. High quality printing and graphics devices provide
publication facilities which are supported by software (PUB, TEX for
mathematical publication, and POX) which were developed at this laboratory.
Graphics printing devices include: the XEROX Graphics Printer (XGP),
XEROX Dover Printer
(high resolution bit raster), Varian 22" printer/plotter (bit raster),
Canon laser beam printer, and Alphatype photo composition printer.
Extensive graphics packages exist for vector graphics, gray scale and
overlay, for display and for hard copy.
Communication network: A BBN TIP (Honeywell DDP-516) provides connection to
the ARPANET. The system is interfaced to a local network, the
Ethernet, which will connect a DEC 2050 system, several DEC VAX systems,
and a network file server. Arrangements are being made for production of
a large number of high performance raster graphic displays based on the
Motorola 68000 microcomputer, connected to the Ethernet.
A pair of Stanford Scheinman arms are used for experiments in assembly.
They were designed and built here at Stanford, the first in 1970, the second
in 1972. Descendents of the Scheinman arms are mass produced at Unimation
and Texas Instruments.
Two Unimate 600 (PUMA) arms are interfaced directly to AL, without the
VAL system.
Two Unimate 250 arms are in use, one in Aero and Astro and one in Mechanical
Engineering.
\JOne Stanford arm has a Scheinman wrist force sensor which measures three components
of force and three components of torque. It measures a 300gm weight to within 5 gms.
The calibration has been stable for months.
There is a simple program which automatically calibrates the wrist. The user
need only pass a weight and weight with a lever arm to the arm.
Two pairs of force sensing fingers have been
built, the first measures one component of force, the other measures three components.
These fingers are being interfaced to the arms. Their sensitivity is .1 gm or so.
\JThe assembly workstation has a flexible and accurate setup capability,
with accurate locating holes and screw holes for clamps. A computer controlled
vise (with position feedback) and screwdriver (with velocity feedback) are used
for assemblies. More assembly tools are planned, including a moving belt.\.
\JA PDP11/45 with 124k wds of memory controls the arms. It is interfaced
to the KL10 I/O bus and the Ethernet.
A PDP11/60 will be used for real-time arm control, with the PDP11/45
running the AL system.
A TI system with three 990/10 minicomputers and 1.5 M bytes
of memory will be used for computer vision; it is shared with research on
multi-processor concurrent operating systems.\.
\JA pair of solid state cameras, GE TN2500, will be used for stereo vision.
There is a vision module, Machine Intelligence VS-100, connected to a
GE TN2500 solid state camera together with a light table. It analyzes
silhouettes of objects for classification and location, and is coupled
to the AL system.\.
\JA Grinnell GMR-270 display system with 512x512 resolution with 36 bits per
pixel provides gray scale and graphics. It
is shared among users by a video switch. The system accomodates various combinations
of users: four users with 9 bit black and white
images, two users with two 9 bit channels each, or one user with 3
color channels of 9 bits each plus
another user with a black and white channel are some of the possible configurations.
The display system has an arithmetic processor and tv digitizer.\.
An Optronics C-4100 color drum scanner is on order. It will provide
digitization of images from photographs.
A computer-controlled animation box permits computer synthesis of movies,
with filter control for obtaining color from a black and white monitor,
and providing single-stepping.
Digitized stereo images may be viewed and processed at a stereo station.
The station is comprised of a pair of black and white monitors, 17" Conrac QQA-17C
high resolution video monitors, and a modified Old Delft III scanning
stereoscope.
The Grinnell display system provides video to the stereo station monitors.
Interactive stereo processing of the displayed imagery may be
achieved by means of a cursor displayed in stereo in three-space. The
cursor can be manipulated by trackball
control through the PDP-11 and PDP-10 computers.\.
Considerable additional robotics equipment is planned for which funding
of $100,000 has been approved.
\CFunding
\JTotal funding among our collaboration with Computer Science,
Aeronautics and Astronautics, and Mechanical Engineering is about $938,000
per year. The Rehabilitation project has additional substantial funding.
Of this amount, $230,000 is from the National Science Foundation for
Production Research and Technology, 491,000 is from ARPA, Dept of Defense,
$100,000 is from NASA, and there are 100,000+ from various sources.
An additional $400,000 is likely based on current negotiations.
!\F0\CACCOMPLISHMENTS
\F0\JRobotics research has led to products. The Scheinman arm led to
the MIT arm by Scheinman.
Several dozens of these arms were built and used by various research groups.
It has been one of the major research arms. These developments
led to the arm produced internally by
Texas Instruments, and led to the Unimate PUMA. The VAL system
was based on our second software system, WAVE, and was programmed by
one of our graduate students, Bruce Shimano, while he was working on
his PhD degree. It appears widely recognized that Unimation got a
lot out of the PUMA development. It is not so widely recognized that
the software system was also important.
The Scheinman wrist force sensor was produced for three research laboratories
other than Stanford. The design is the basis for several recent sensor
developments, including one by Unimation which may lead to a product.
Binford conceived of "structured light", independently
along with ETL, Tokyo, with contributions from IBM [Binford 71].
Structured light has
broad importance as the basis for practical ranging devices. Many uses of it
are under development.
[Binford 71] originated the "generalized cylinder" representation for object shape.
[Agin 72] used it in describing object primitives using structured light.
[Nevatia 74] demonstrated recognition of dolls, toy horses, and tools, using
range data. The system learned by showing in three dimensions.
A model was put on the table in front of the laser.
The system built its own models of objects in terms of part/whole graphs
of generalized cylinders. The system recognized objects when shown in a
different position and orientation, with changed articulation of the object,
and with some obscuration. The system demonstrated an indexing capability
to determine a subset of similar objects, for example, matching a doll to
the class of quadripeds. Indexing was based on stick figures
using an attachment hierarchy as a coarse description.
This work is still a landmark.
[Paul 72] developed the WAVE programming system for robots (actually our second
system), and demonstrated
he first computer-controlled assembly.
It used tools, sensing, and vision.
A number of assemblies were carried
out in that era, including several sub-assemblies of a two-stroke gasoline engine.
It was clear that the complete assembly of the chain saw motor would be more of
the same. Emphasis was shifted to the two crucial areas of utilizing a robot
in assembly and related tasks, namely sensorimotor control and programming.
AL was designed in 1974 and built in 1975-76. An AL interpreter, initially
called POINTY, was developed for interactive programming.
Two other groups have developed version of AL for their own use. AL will be
available under license in 1982.
Force control was used in a primitive way in WAVE.
[Shimano 79] developed a force control system with considerable capbility.
[Salisbury 80] developed a sophisticated system for programmable compliance
and force control which appears to have sufficient speed,
generality, and sensitivity. This is a good candidate for applications.
ACRONYM is a major advance in three dimensional vision systems [Brooks 81].
It promises to make a substantial contribution for inspection and vision
applications. It will be available as a research system under license in
the 1983 time period.
Major advances in inferring surfaces from images may provide significant
capability for bin picking and other three dimensional problems [Binford 81].
Recent advances in edge finding provide a basis for industrial vision systems
based on gray scale. Advances in stereo may provide an alternative to
structured light for ranging.
Based on recent advances, powerful computer vision is much closer to
realization than might have been imagined. In part this follows from
finding a uniform structure for intermediate level vision operations which
appears implementable in VLSI, in part from progress on stereo, edge finding,
and grouping edges, in part because of theoretical work on interpretation.
** Ohwovoriole
Roth
Cannon: satellite
!\F2\COTHER CONSIDERATIONS
\F0\CPlans
\JThe manipulation laboratory will be moved to Durand building to space
provided by the Aeronautics and Astronautics Department. This will
make an already close collaboration more effective, providing a higher
level of sharing in support personnel, and a larger effective working group.
Even though this is one of the larger groups, funding has been a problem,
resulting in inadequate hardware and software support, and inadequte equipment.
A significant expansion is being sought to provide adequate support for a
substantial laboratory. This will be important for participation of visitors.
A major expansion of governmental support is foreseen. This will provide
a base for maintaining a major facility for expansion of industrial
collaboration.
Thus far, we have been able to recruit talented people given funding.
\JWe plan soon to solicit participation by a number of firms in the activities
of the robotics laboratory. A prospectus will be prepared.
A number of firms have indicated interest in the prospectus.
Participation will be in three forms:
\j1. Affiliates. Similar to the SRI Industrial Affiliates program.\.
\j2 Projects. Two sorts of projects will be pursued: a. projects
involving small groups of firms dealing with laboratory research topics,
such as development of the AL system, next generation programming language
for robots, inspection, geometric modeling. b. Projects with single firms
which may be initiated by the participating firm.\.
\j3. General Laboratory Support. This is meant to be major participation
in the activities of the laboratory, including major support, strong
advisory involvement, and participation of personnel in research.\.
The robotics laboratory will participate in the forming of the Stanford
Advanced Automation Center, an effort covering considerable other areas
of manufacturing, encompassing participants from the departments of Materials, Computer
Science, Mechanical Engineering, Electrical Engineering, Industrial
Engineering, Applied Physics, Economics, and the Business School.
We also anticipate strong collaboration with the Industrial Automation division of SRI,
with MIT, and with JPL.
**system plans
\CHistory
We have had a number of visitors from industry, including Dr. David Grossman,
IBM, leader of their robotics research program, and Dr. Bruce Bullock, Hughes
Research Labs, Malibu, leader of their program in Image Understanding.
We have small levels of support from GM Research Labs and Alcoa Foundation.
The support and the information from these contacts have been valuable
to us in guiding our research program. We had a major equipment grant from
Texas Instruments.
We have relatively strong contacts with Unimation West and have agreed
to a collaboration on mobile robots. Joint efforts are being negotiated
for medium scale research projects with several other firms.
Through various programs related to automation, we have had frequent
contacts and frequent visits from many phases of industry. We have
visited many firms. We have done a variety of consulting for vision
related problems.
\CBuilding prototypes or production systems
We are willing to build prototypes and in exceptional cases to participate
in building production systems. In many cases, we think that it might
be appropriate to build prototypes at Stanford, where special skills are
well-matched. It seems important to transfer the knowledge and skills,
perhaps by having relevant industrial participants.
It seems relevant to transfer that technology to either
personnel of a collaborating firm, GM if it were involved, or to arrange
manufacturing and engineering for production systems, or to arrange a
spinoff. We might also be willing to participate in crucial parts of
production system design and system integration, without undertaking total system
effort.
As an example, we will seek a qualified agent to distribute, support, and
do some development on the AL system. Given appropriate resources, we would be
willing to undertake it ourselves. If there were an agent for AL, we would be
interested in providing significant new developments or adaptations
of AL.
As another example, Stanford has initiated a consortium for instrumenting
PUMA. We are undertaking design, soliciting contribution of engineering
from members of the consortium.
We will arrange outside fabrication and assembly at favorable prices for
those interested.
Through collaboration with the SRI Industrial Automation division,
efforts in building prototypes or production systems might be shared.
\CConditions on an industrial grant
I am not able to represent Stanford's legal position on industrial grants.
I will give my own basis for negotiation.
One considerable issue is information interchange with foreign competitors.
We do realize an important problem in competition. Thus we have already
adopted a preferential policy for domestic companies, and plan to further
implement the policy in the areas of information transfer, participation
in affiliates programs, and long term visitors participating in the research.
We have
adopted a policy of complete disclosure for US firms, and disclosing
published material to foreign firms. Please keep that in confidence.
This means not only a time advantage, but the benefit of much evaluation
and planning. We think that the research plan and motivations for it
have major value. We plan not to have affiliation with foreign companies.
That may not be possible to maintain since there are multinationals and
many firms have foreign arrangements. We plan to screen long term foreign
visitors severely for possible competitive concern. We have none now,
and will be quite selective.
I do not have a ready formula for patent rights. I believe that there are
some patents arising from a joint effort which are most reasonably Stanford's,
and some which might originate largely from GM's interest. I thus would
argue for a definition of assignment of rights, and also licensing
agreements, both non-exclusive and exclusive. Some guidelines might be
the extent to which GM's support vs public support contributed; the extent
to which patents are natural outgrowths of Stanford's ongoing work vs work
which is stimulated by GM's support; the extent to which the technology is
generic vs specific to GM's problems.
It is difficult in this environment to preserve proprietary secrets.
A certain level of confidentiality could be maintained, but the open
environment and access of many people to conversations make absolute
secrecy difficult. We actively support maintaining proprietary
matters, but access would have to limited to a few people, for example,
the leadership of the project.
We do not take the stand that all information should be openly published
and transmitted. Neither do we think that outside censorship is appropriate.
That is, it does not seem feasible at Stanford to suggest that GM should
approve publication of reports based on joint efforts. We actively
support controlling certain information including results of research.
Note that we have such a policy now, within the group.
On the other hand, students and others are dependent on the publication
of scientific results for advancement and payoff. We think that the major
policy should be open publication, with some exceptions.
A formula would have to be negotiated concerning types of exceptions.
In general, generic technology should be open. For example, our specialty
is robotics. If GM has some commercial interest in selling robots, it
is still not acceptable from our point of view to lock up all fundamental
results on robotics because of GM's commercial interest.
Sabbaticals between participants should be encouraged in both directions.
It will be
encouraged that personnel from GM visit, within limits of productive
interchange. Particular emphasis is made for visits of sufficient time
to contribute to the research effort. Teaching and technology transfer
are encouraged, however they are most fruitful within the context of
an involvement and contribution in research.
In general, the guidelines should be to maximize research and teaching on
a high level. A limited amount of
non-participating training can be accomodated.
Several
forms of arrangements might be made. For example, short assembly experiments
by GM staff would be encouraged. Visits to evaluate technology hands on
by comparison would be encouraged. Visits of six months or more are usually
required for successful contribution, except for those with unusual skills.
An MS program like that in Computer Science specializing in Artificial Intelligence
might be an incentive for attracting good young people.
It is expected that an industrial partner take a strong advisory capacity
in directing R&D efforts. It is expected that both extensive fundamental
and applied research are involved. It is not expected that the industrial
partner have the power to dictate, but to advise and evaluate.
We are actively seeking a GM representative on an advisory committee to
oversee our NSF-supported productivity research program, whether or not
GM decides to award a grant to Stanford. In general, I think that such a
committee would have a strong influence on research directions. We listen
carefully to industrial experts concerning productivity.
\CWorking relations between Stanford and a company funding research
Arrangements are made between individual groups in Stanford and their
donors. We have had only small support in robotics, and have had very
warm and valued, informal contacts. We would propose that
for a large effort, the contact be more formal and frequent, but not
bureaucratic. Reports should be made, but they should be minimal. We
see the following mechanisms: 1. participation of one member of GM on the
NSF advisory committee; 2. a small advisory committee for the proposed
GM project, to meet at intervals of six months. 3. informal technical
leaders on each side who communicate roughly at intervals of two to
three weeks. 4. participation of visiting GM researchers in weekly
group project meetings. 5. Minor reports at six month intervals
summarizing presentations at advisory committee meetings.
If the informal parts of these arrangements prove adequate and if the
formal parts prove burdensome, the formal arrangements might be relaxed.
!notes
VAX81
references
sensing: RMS 1972
assembly
SUN terminal
VLSI project
∂09-Aug-81 1416 JMM ekl proof
To: JMC, JK
CC: JMM
Another proof- rev.prf[ekl,jmm] is ready which shows ∀u v.rev(u,v)=reverse1(u)*v
This approach seems to be quite winning- and conceptually clearer than the
heavy sorting approach.A skillful use of DECSIMP will reduce the lengths of the
proofs considerably.
The proof seems to be all one line.
∂09-Aug-81 1522 JMM
to get the reverse proof:
(get-proofs rev)
(proof prf3) ;; the internal name of this proof also is prf3-rather than
rev ;;this is because it hasn't been renamed-there is a bug in the command
to be used.
∂09-Aug-81 1912 RPG via CMU-20C Vacation
To: lisptiming at SU-AI
In case some of you are wondering what is up with the Lisp timing
project, it is temporarily on vacation while I am at CMU working on S-1 Lisp.
In the fall, arpa is partially funding the effort and I will have a grad
student to translate many of the benchmarks for the various sites.
See you in the fall.
-rpg-
∂10-Aug-81 0333 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #23
Date: 10 AUG 1981 0622-EDT
From: DUFFEY at MIT-ML (Roger D. Duffey, II)
Subject: HUMAN-NETS Digest V4 #23
To: HUMAN-NETS at MIT-AI
HUMAN-NETS Digest Monday, 10 Aug 1981 Volume 4 : Issue 23
Today's Topics:
FYI - Hand-crank telephone system & Phone burglary,
Computers and People - Computerese/Computerish
----------------------------------------------------------------------
Date: 7-Aug-81 11:05:12 PDT (Friday)
From: Hamilton.ES at PARC-MAXC
Subject: Re: the Nations only "Hand-Crank Phone System"
I guess it depends how you want to define "town". Deep
Springs College in California and Oasis, Nevada (a few ranches)
still have a modern hand-crank system, operated by Continental
Telephone. The operator is across the White Mountains in
Bishop, CA. There are no plans to install dial service, due
to the large cost and the limited number of people (< 100)
being served.
--Bruce
------------------------------
Date: 6 Aug 1981 2257-PDT (Thursday)
From: Eps at UCLA-SECURITY (Eric P. Scott)
Subject: Another Mitnik bites the dust...
To: Admin.MRC at SU-SCORE
CC: lauren, Ellen at MIT-MC
Remailed-date: 7 Aug 1981 1236-PDT
Remailed-from: Mark Crispin <Admin.MRC at SU-SCORE>
Pasadena Star-News, Wednesday, August 5, 1981
Youth admits guilt in phone burglary
By Becky Bartindale Staff Writer
A 17-year-old self-described "phone freak" has admitted to a
felony count of attempted burglary of the Pasadena central office
of Pacific Telephone & Telegraph Co.
The Pasadena youth, whose name cannot be used because of privacy
laws, also admitted he was in violation of conditions of probation
stemming from an earlier brush with the law.
Deputy District Attorney Stephen Cooley, head of the Pasadena
juvenile division, said that another 17-year-old boy, a friend
of the Pasadena youth, was convicted last month in connection
with the burglary of a telephone company office and the theft
of phone company manuals containing computer codes.
The Pasadena youth was not involved in the theft of the
manuals, he said.
Cooley described "phone freaks" as members of "cultlike groups,
primarily young people, who are usually involved with manipulating
the phone company's operations, and to a great extent, this interest
overlaps into various forms of computer abuse."
Both youths are high-school dropouts, Cooley said.
The Pasadena boy has been scheduled for a disposition hearing
Aug 13. in juvenile court.
------------------------------
Date: 10 Aug 1981 04:00-EDT
From: "The Moderator" <Duffey at MIT-AI>
Subject: Computers and People - Computerese/Computerish
When I restarted HUMAN-NETS following its 3 week hiatus in June,
there was several weeks worth of backlogged material. The bulk
of the backlogged material was divided between three discussions.
The material from two of these discussions (the telephone system
and C language query material) has now been run. With today's
digest we return to the last of those backlogged discussions -
computer jargon.
The next message in today's digest is an editorial by H. Bruce
Miller of the San Jose Mercury. It appeared in HNT V3 #108.
Our thanks to both Bill Daul and Jim Wagner for taking the
time to submit copies of this editorial. We regret the length
of time that has been needed to publish the rebuttals to this
editorial.
For the convenience of our new subscribers (and to refresh the
memories of our long-term subscribers) a transcript of the past
HUMAN-NETS discussions on jargon is available on MIT-AI in the
file DUFFEY;HUMNET JARGON.
Enjoy,
Roger
------------------------------
Date: 9 Jul 1981 1442-PDT
From: JWagner at OFFICE-1
Subject: Computerish -- whose default is it?
The following editorial appeared in a recent issue of the San Jose
Mercury, the daily newspaper for San Jose CA and vicinity. I've
sent it along without comment on my part -- I think it may make
a good topic for discussion.
------------------------------
NOW I HAVE TO LEARN COMPUTERISH -- AND WHOSE DEFAULT IS IT?
by H. Bruce Miller editorial writer for the San Jose Mercury
Life handed me a couple of exciting new experiences this
month. First I had two impacted wisdom teeth removed. Then I
underwent two and a half hours of training in how to use our
new computer system.
Since the computer training was done without benefit of
nitrous oxide or Novocaine, I'd have to rate it as somewhat
the less pleasant of the two.
Some of you might infer from this that I don't like
computers. Nothing could be further from the truth. I am not
one of your technological Neanderthals who want to go back to
cooking on an open fire instead of a microwave and using slide
rules instead of pocket calculators. I love computers. It's
the computer people I can't stand.
The trouble with computer people is they don't know how
to speak English. They speak something that sounds sort of
like English, but when you listen closely, it's not. It has
some English-sounding words and some structural similarities
to English, but it's not English, nor is it any other known
human tongue, ancient or modern. It's Computerish, which
resembles English roughly and pig Latin resembles the language
of Virgil and Cicero.
Computerish is a language in which words and their meanings
undergo bizarre and seemingly random transmogrifications. Verbs
metamorphose into nouns, and nouns transform themselves into
verbs at the drop of a suffix. New words magically appear from
nowhere, and old words take on meanings completely unrelated to
their accepted ones.
The result is a form of prose that for incomprehensibility
is rivaled only by the discourses of 12th century theologians
and the press releases of the Environmental Protection Agency.
Here, for example, is a paragraph from the manual used in my
training session, in the original unexpurgated Computerish:
"All forms, prompts. and template takes are treated
identically with regard to cursor movement and the editing
data. The appropriate message - 'FORM,' 'PROMPT' or 'TEMPLATE'
- is displayed in the bright attribute on the status line. In
any of these modes the cursor may be moved only within variable
fields; it may not be moved into protected areas."
A few definitions may further illustrate how Computerish
works.
First there's the word "access" used as a verb, meaning
"to call up" or "to obtain," viz.: "To access your basket,
press Command D."
There's the word "prompt" used as a noun, meaning a group
of underlined spaces that appear at the top of your computer
screen and into which you type directions, viz.: "When you
press Command 2, a prompt will appear on the screen."
There's the word "default" used as a noun, meaning, as
far as I can determine, one of the functions that an individual
computer user is empowered to perform, viz.: "A list of user
defaults may be accessed by pressing Command U."
There's the noun "attribute," which is what we newspaper
old-timers used to call a type face, such as italic, boldface,
or bold italic, viz.: "Ten VDT attributes are available for
use with STYL typesetting procedures.
Then there's the word (this is one of my all-time favorites)
"template." As we all know, in English a template is a cardboard
or plastic or metal pattern used for cutting something to a
particular shape or marking the correct location of something,
as in installing a doorknob. But in Computerish, templates are
"openings ... wherein the user may draw or, in this case, enter
and edit texts. In template takes, the openings are called
fields." I hope that's perfectly clear.
Now, template is a very nice word. So are charabanc and
quinquereme and peritoneum, any one of which would have served
just as well as "template" for the particular purpose.
That's the maddening thing about computer people. They
use words interchangeably, like pieces of an Erector set,
with blithe disregard for their individual meanings. Need
a noun? Just throw one in, first one that pops into your
head. "Template"? Sure, that's fine, why not. Need a verb?
Stick "ize" on the end of a noun and you've got it. Computer
people are like Lewis Carroll's Humpty Dumpty: When they use
a word it means what they want in to mean.
Newspaper people, on the other hand, regard words as
precision instruments to be used as carefully and accurately
as possible. It's a matter of training and, I suspect,
temperament. Consequently, the relationship between newspaper
people and computer people is an uneasy one, marked by chronic
mistrust and occasional overt hostility.
There are just two possible cures for this. One is to
get the computer people to learn English. The other is to
teach the newspaper people Computerish. From what I've seen
of computer people, learning English is beyond the capacity
of virtually all of them, so newspaper people presumably will
have to take courses in Computerish.
Eventually this will improve communications between
computer people and newspaper people. What it will do to the
quality of American journalism is, of course, another matter.
But that's a template of a different attribute, and I guess
we'll have to parameterize that default when we access it.
------------------------------
Date: 3 Jun 1981 1948-EDT
From: SILBER at RUTGERS
Subject: English and Evolution
I just started reading Human-Nets and have read the letters
on the impending decline and fall of the English language
with great interest. The newspaper article in the Digest
about "Computerese" (that may have been a while ago) made
some points that I wanted to respond to.
One of the major gripes that the good journalist had against
computerese was its unfortunate and allegedly un-English
tendency to make nouns from verbs, verbs from noun, and
adjectives from everything. He seems to have forgotten that
English syntax has been getting increasingly more flexible
for at least the past thousand years (ever since we lost
most of the old Indo-European inflections and cases). What
do you call the little mark that appears on your screen to
prompt you to input (aha, more computerese! But the truth
is I couldn't think of a graceful substitute.) your response?
A prompt, of course.
Of course the process is not confined to the computer field.
To take some examples that the afore-mentioned journalist
probably uses every day, how about the transformations from
television to televise (the verb) to televised (the adjective)?
Thanks for listening,
Rachel Silber
------------------------------
Date: 28 May 1981 11:11:44-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
Subject: jargon and journalists
It looks to me like the system installed in the San Jose
newspaper's offices had some particularly dreadful user manuals;
I'm dealing with that problem now in trying to rewrite a micro
editor handbook, originally written for micro hackers, so that
people with no real previous computer experience can handle
it. But I don't think such terrible documentation is the rule;
certainly a manual I've used for similarly-motivated equipment
(A/M COMP-SET (tm) phototypesetter front end) is quite clear
and easy to understand. Maybe there just aren't as many
literate hackers in the company they bought their system from?
As for his claim that journalists speak/write clear, normalized
English -- BULL!! The standard of writing even at the New York
TIMES is not high, and at such major-city newspapers as the Boston
GLOBE it rapidly approaches terrible. I grant that it's still
better than what is produced under the label "writing" in today's
schools, but today's schools have become a case for the Truth in
Advertising act rather than for the grammarian. It's reasonable
to say that my standards are too high to be practical, since most
of my editing work has been for books or quarterlies, but this
just points out the flaw in writing for daily papers: the editor
can't ask for it to be great because heesh needs it \\now//.
Which brings up the parallel question of the extent to
which the journalist should be obliged to serve as a translator.
For instance, I'd argue that anyone who doesn't understand the
meaning of (for example) "marginal cost" has no business writing
even a general-interest article on economics --- but I've seen
such absence of knowledge in such articles.
Two more points before I end this overlong flame:
1. Some portion of hacker language offers the advantage
of brevity and conciseness -- sufficiently so that some
words (such as "crash") seem to be working back into the
"standard" form of English.
2. Has anyone else been reading the biweekly computer columns
in the Business section of the Boston GLOBE? They strike
me as a much more constructive approach to the problem and
seem reasonably clear and accurate besides.
------------------------------
Date: 29 May 1981 09:44-EDT
From: TRB at MIT-MC
Subject: San Jose News Editorial on Computerese
Now here's a case of a man blinded by ignorance, ready to criticize
before he learns. He complains about verbification (ugh) and such,
but uses words like incomprehensibility and transmogrification while
doing so. What College of Linguistic Cardinals decided that those
nounizations should be allowed, and not "initialization," which has
quite a specific meaning when used in a hygiene program with regular
dental care. The author of that editorial obviously didn't bother
to ask what the words meant, or he would have had proper definitions
of prompt and default. Perhaps he'd like his reference to read: "If
you don't type anything at the place where the computer asks you to
type something then the computer will put what it thinks is the best
answer in the place where you type the thing that says move on to
the next thing." I like "defaults" better.
I'd be happy to do away with "finalize".
Andy
------------------------------
Date: 28 May 1981 09:41:03-PDT
From: sdcarl!rusty at Berkeley
Subject: H. Bruce Miller's editorial
Reply-to: "sdcarl!rusty@Berkeley in care of" <CSVAX.upstill@Berkeley>
This editorial was mildly amusing at best. What struck me was the
line:
"Newspaper people, on the other hand, regard words as
precision instruments to be used as carefully and
accurately as possible."
Isn't it amusing how the people in the media have such over-inflated
opinions of themselves?
------------------------------
End of HUMAN-NETS Digest
************************
∂10-Aug-81 0900 JMC*
Norberg at Babbage in Milwaukee
∂10-Aug-81 0900 JMC*
Burge
∂10-Aug-81 1003 CLT francs
I called MLPFS and it is OK to deposit a check on a French bank.
(Can't be withdrawn until the check clears)
If you want to bring the checkbook, I have deposit slips here.
∂10-Aug-81 1300 JMC*
couple[lit,jmc]
∂11-Aug-81 0049 Bob Engelmore <CSD.ENGELMORE at SU-SCORE>
Date: 11 Aug 1981 0047-PDT
From: Bob Engelmore <CSD.ENGELMORE at SU-SCORE>
To: JMC at SU-AI
In-Reply-To: Your message of 10-Aug-81 1122-PDT
John, Idon't think there is an omnibus policy to cover these situations.
Each one is taken individually. I personally see no harm in exporting
FOL, but my opinion no longer counts. Suggest you take it up with Bob
Kahn or Ron Ohlander.
Bob
-------
∂11-Aug-81 0420 DUFFEY at MIT-ML (Roger D. Duffey, II) HUMAN-NETS Digest V4 #24
Date: 11 AUG 1981 0707-EDT
From: DUFFEY at MIT-ML (Roger D. Duffey, II)
Subject: HUMAN-NETS Digest V4 #24
To: HUMAN-NETS at MIT-AI
HUMAN-NETS Digest Tuesday, 11 Aug 1981 Volume 4 : Issue 24
Today's Topics:
Computers and People - Third Wave Education & Computerese/Computerish,
FYI - Hand-crank telephone system
----------------------------------------------------------------------
Date: 10 Aug 1981 1432-PDT
From: Brian Harvey <BH at SU-AI>
Subject: computer education
I am working in a public high school in Sudbury, Mass. teaching
with/about computers. I'm interested in hearing from anyone with
similar interests. Our school administration is enough behind
the idea of computer education that I have a PDP-11/70 with 27
terminals, quite a lot compared to most high schools although
(of course) not nearly enough! We run v7 UNIX.
I'm a LOGOite; in other words, I'm interested in using computers
to teach kids independence and problem-solving skills rather than
in vocational training of computer programmers. Introductory
students program in LOGO; we also use C, LISP, APL, and PASCAL.
No BASIC! (There is a sort of BASIC on the system, but I don't
encourage its use.) We have some Atari 800 micros which we use
as graphics terminals for PDP-11 LOGO.
I'm also very interested in teaching kids the idea of community.
We have a Computer Users Society which, in principle, runs the
computer center. (I haven't quite gotten out of doing a lot
of the running myself, yet.) Members have keys to the room
and can use the computer evenings and weekends. The place is
almost never empty! I also find that they need to be taught
about Chinese food, which involves driving to Cambridge.
(Sudbury is about 20 miles away.)
Anyway, I'm interested in finding out what anyone else has to
say about
- running UNIX in a high school
- how to write curriculum materials which will
encourage playfulness rather than "do this exercise"
- how to deal with everyone's perception of computer
kids as weird
- how soon the 16-bit micros will make good software
available to more schools, and how to prepare for it
- whether this can all be done by teachers who weren't
AI hackers first, and in general, how to find or
train suitable teachers
- how to resolve conflicts among the goals of student
independence, excellence, and community spirit
(I could fill a couple of kilobytes expanding on
that one...)
- how this fits in with the politics of education
in general (e.g., I have a lot of flexibility in
computer courses, like not giving grades, but the
rest of the school is moving more "back to basics")
- etc.
I'm not a HUMAN-NETS subscriber, since I don't log in often
enough to keep track of my mail as it is, so please include
me (BH@AI) explicitly in any responses. Or get in touch with
me (not this week--I'm in California) by conventional means:
Brian Harvey
Lincoln-Sudbury Regional High School
390 Lincoln Rd
Sudbury, MA 10776
617 443-9961 ext 60
------------------------------
Date: 10 Aug 1981 1525-CDT
From: Clyde Hoover <CC.CLYDE at UTEXAS-20>
Subject: Journalism vs computers
I read the aforementioned editorial with great amusement. For
the first (and more important part), it really does seem quite
tounge-in-cheek in many places, and so the indignant reactions
evidenced in recent HUMAN-NETS are widely misdirected.
However, there remains a grain of truth to the entire discussion.
I was in the position of being the 'computer jock' at the campus
newspaper here for a couple of years, and the process of attempting
to invoke an understanding of just how the bloody thing worked (and
why it upon occasion didn't), would try the patience of Job.
This does raise a very important problem of interfacing 'the
unwashed masses' to not only using computers (any 1/2 wit can
have a CRT keyboard slipped under their fingers), but to utilize
their potential. Too often those who know make the directions
for those who don't cryptic and jargonistic, leading to less
understanding and more confused surrender and a 'just tell me
what I need to do to get X done' attitude.
Clearly, computers are not the only technological area
where this problem exists, but with the rapid proliferation of
computers, our area will be at the forefront of this problem.
BTW, I really cracked up at the 'journalists regard words as
precision instruments' bit. Maybe he works in such a Utopian
environment, but all the newspapers I've ever had had first-hand
knowledge of are more inclined to use them as BLUNT instruments!
------------------------------
Date: 31 May 1981 13:23 edt
From: Sibert at MIT-Multics (W. Olin Sibert)
Subject: "computerish"
A brief consultation with a dictionary (I used the American
Heritage) would have revealed to our erstwhile author that
those words he found so offensive were, in fact, being used
reasonably.
For instance, he would have learned that a prompt is (among
other things): "Noun. 1.a The act of prompting or giving a
cue. 1.b The information received, a reminder or cue". He
would also have learned that a template is not always a little
piece of plastic with holes in it, but, rather, "A pattern or
gauge, such as a thin metal plate or cut pattern, used as a
guide in marking something accurately, as in woodworking, or
in replication of a standard object". The template he was
working with presumably had no tangible existence, but was
probably being used as a guide in marking something.
It is true that the computer industry has more than its share
of obscure jargon, and, especially, acronyms; these are very
legitimate targets for complaint. But, that editorial com-
plained about the use of perfectly reasonable words to explain
concepts which the author had never encountered before. The
editorial wasn't complaining about jargon or acronyms, but
rather about having to learn something new -- and was really
just an unjustified diatribe against the computer industry,
replete with ad hominem attacks on "computer people". In
addition to being silly, this is scarcely professional.
A lot of effort has been put into making computers understandable
-- but it is inevitable that this involves learning something
about computers. Computers present new (and, we like to think,
better) ways to do things -- but these ways are different from
the ways in use before.
The technology is not at the point (regardless of whether it
ever should be) of being able to understand hastily scrawled
proofreaders marks on paper. So, in order to use computers
for this purpose, we must do something similar, but practical
in terms of technology. Using computers in this fashion is
arguably more efficient, but, regardless, it is different.
Imagine the consternation of someone who has used a word
processor for years who suddenly is required to learn
proofreaders marks.
------------------------------
Date: 31 May 1981 17:17 PDT
From: Reed.ES at PARC-MAXC
Dear H. Bruce Miller,
Re: your article in the SJ news on "Computerish".
Perhaps your manual was not complete. I offer the following
derivations which describe in clear detail the origins of the
terms you write of. But first, a few definitions from Webster's:
"access: n. ... 1. Approach; admittance; admission...as,
to gain ACCESS....
2. A means, place, or way of approach".
"prompt: adj. 1. Ready and quick to act as occasion demands....
n. 1. A limit of time given for payment of an account...
2. a Reminder.
v.t. 1. To move (one) to action 2. ... to give a cue to ...."
"default: n. 1. Failure to do what is required by duty or law....
v.i. 2. To fail in fulfilling a contract ....."
"attribute: n. 1. That which is ATTRIBUTED, as a quality or character
ascribed to....
3. A word.. ascribing a quality (to some person or
thing)"
"template: n. ... 2. A gauge, pattern, or mold ... used as a guide
to the form of the work."
First, ACCESS. As you can see from the definition, an access is
an "approach...as to gain ACCESS". Thus we have a case of a writer
using one word where a more garrulous sort such as yourself would
have to put in two. Or rewriting the sentence, "to gain admission
to your basket, press command D". You can't look in your basket
without gaining admission to it - remember the computer is between
you and your basket, and you must ask first!
Let's take the next one, PROMPT. The relevant definition here is
the second noun definition. A "prompt" is just that - a REMINDER
that input is desired. Hardly an incorrect use of the word,
unless you don't like Webster's.
Default - well, you might have a case there. Defaults in
"Computerish" are values that the computer supplies for you when
you forget them (default on them as it were) or don't care - that
is, when you fail to fill in the blanks. You see, computers don't
always know what you mean when you forget things, but programmers
like to help out by giving them something to work with in those
rare cases where you don't remember to tell them yourself.
Attribute. Here we see your ignorance begin to shine through.
Attributes are (according to Webster's) just what your manual
meant them to be. You have failed to be able to tell the
difference between terms specific to your profession and a
more general term which covers them all, and in other contexts
as well. The attributes referred to are the characteristics
of the display, some of which may be the particular attributes
you refer to - such as bold or italic, and some of them may
not have anything to do with type face. Type faces are attri-
butes that editors like to give to text to emphasize certain
points. Certainly you have used these text attributes in your
newspaper before, haven't you?
Template. I am really glad this is one of your "all time
favorites". That makes it much easier to claim that you don't
know what you are talking about. A template is a pattern used
as a guide to the form of the work - according to Webster's.
In "Computerish", it is exactly the same thing. The areas to
be filled in (the "fields") are analogous to the holes in the
template which a worker will use to place the doorknob. Do you
mean that you didn't know that a form letter was a template
with its fields filled in?
It's one thing to criticize bad English. But these words are
used by computer people to mean almost exactly what my dictionary
says they mean. I can't forgive any technical writer for being
unclear - the opposite is essential to the profession. But your
choices of "Computerish" do not prove that computer people mangle
the English language, only that you are somewhat ignorant of
it yourself. These particular choices actually illustrate the
ability of the English language as it now exists to represent
the broader spectrum of experience that exists in our modern
world. I, too, am tired of poor technical writing - it abounds
in all fields, not just computers. But that is a problem of
poor education, something everyone seems to get these days.
What you and others are really rebelling against is the
propensity of specialists to forget that others do not share
in their specialty. I do not claim that computer people are
not jargoneers (my own word, please excuse me). This is a
common ailment. I know of no profession that doesn't have
them, including your own. Legalese, journalese, etc. - these
terms have been around longer than computers have been commonly
available ("journalese" appears in my 1961 edition of Webster's).
Journalists such as yourself are guilty of the same mangling of
the English language that you ascribe to computer people. In
fact you are much more visible to the public in this respect
than are we, and perhaps a good deal more culpable. Even some
journalists have recognized the problem, including Edwin Newman
- remember him? A few examples will emphasize my point:
shortfall: shortage
Reagonomics: Reagan's economic philosophy
across-the-board: in every category
roll-back: as in "price roll-back", an
"across-the-board" reduction in prices
blah-gate: scandal involving blah (substitute your
favorite scandal for the word blah).
journalese: journalese
It is a very debatable proposition that words are indeed
"precision instruments to be used as carefully and accurately
as possible". That newspaper people regard them so is not a
particularly cogent argument in favor of journalists. Lawyers
and scientists alike regard language in the same light. The
result of attempts to make language as precise as possible is
exactly the subject of this discussion - jargon. Legalese is
an extreme example of this, as is the biological classification
of all life to the subspecies level. Jargon is the direct
result of the increasing specialization necessary to describe
the modern world, and as such expresses a human desire to know
the world more completely.
The use of words as precision instruments, but with careful
inaccuracy is known as propaganda, and was not invented by
Goebbels. It has been a common practice of journalists for
many years. Need I remind you of the recent Pulitzer prize
winning example?
What we really are striving for, both you journalists and we
computer people (lawyers, biologists, etc.) is communication -
trying to get words to mean something close to the same thing
by the time it gets into your brain after being translated
from thoughts to language and back again. For this to work,
the people involved have to know thoroughly the language they
are communicating with and be able to recognize the common
ideas that go into its making. That goes for you as well as
for your poor technical writer.
Sincerely,
Larry Reed
P.S. You don't even know the correct name for computer
scientists' particular jargonization - it's Computerese,
not "Computerish".
(From Webster's again:
"-ese: ... c. Peculiar literary style or diction (of a
certain person of type of publication); as, journalese."
The "-ish" suffix would imply that the words actually
took on the attributes (oops - there's that word again!)
of the computers themselves.)
P.P.S. I am actually going to send this, minus (of course) all
references to Human-nets. Would someone let me know if
it gets published?
------------------------------
TRB@MIT-MC 08/10/81 09:10:35 Re: Central? Get me my Congressman!
Down with OxT&T!
Slaughter the Mother Heifer!
Don't Yank our Cranks!
Huzzah.
Andy Tannenbaum
Bell Labs Whippany NJ
------------------------------
End of HUMAN-NETS Digest
************************
∂11-Aug-81 0920 RGUEST at UTAH-20 VISIT
Date: 11 Aug 1981 1000-MDT
From: RGUEST at UTAH-20
Subject: VISIT
To: JMC at SU-AI
THE TIME SCHEDULE IS AT PRESENT:ARRIVAL IN S.FRANCISCO 15.AUG 12.30.DEPARTURE
19.AUG 13.35 TO BOSTON.WE HAVE TO ADJUST SOME THINGS AT LOS ANGELES.THE OPEN
PROBLEM TO ME IS 1.,HOW MUCH TONY HEARN IS REALLY INTERESTED TO HAVE ME IN
LOS ANGELES AND 2.,WHO WILL BE PRSENT AT MIT.I STILL GOT NO ANSWER FROM THERE.
STANFORD SEEMS VERY INTERESTING BECAUSE OF SRI AS I WAS TOLD THERE IS A PROJECT
ON DATA BASE DEVELOPMENT TOOLS LIKE THAT I HAVE TO START WITH IN ERLANGEN.
FOR HISTORY INTERESTING ARE DEUTSCH,BOBROW AND TEITELMAN.I'VE GOT NO ANSWER YET.
DO YOU HAVE A PHONE NUMBER OF FRIEDMAN / WISE ?HERBERT ST.
-------
To: Herbert Stoyan
1. Friedman and Wise are at the University of Indiana in Bloomington,
Friedman, Daniel 812 337-4885
2. I will try to round up some people interested in the history of LISP.
3. Do you need help with travel from the airport, hotel, etc?
4. Where are you at the moment? How can I telephone you?
5. My telephone numbers are: home 415 857-0672, office 415 497-4430.
∂11-Aug-81 1033 FFL Checked with Dina Bollas. So far everything is OK on your
To: JMC, FFL
reservations. They urge that you get to the airport at least one hour
ahead of departure. I am to call her again on Friday to check if your
Western flight is still going to Canada.
∂11-Aug-81 1512 FFL
To: JMC, FFL
Stoyan called. Said he was coming next week to Stanford. Is going to call you
again about 1 to 1:30 p.m. on Wednesday. I asked for a number but he said
he had no place where he knew he would be today.
∂11-Aug-81 1537 Darden at SUMEX-AIM Re: meeting
Date: 11 Aug 1981 1536-PDT
From: Darden at SUMEX-AIM
Subject: Re: meeting
To: JMC at SU-AI
In response to your message sent 08 Aug 1981 1046-PDT
Hi, John. Thanks for the invitation but I will be camping in Maine that
week. Have a good trip.
Bye, Lindley
-------
Have a good camping trip. Don't get bitten by too many mosquitoes.
∂11-Aug-81 1757 JMM
To: JMC
CC: JK
See appnew.prf[ekl,jmm] for a shorter proof of append (13 lines)
∂11-Aug-81 1928 JK another proof of append
To: JMC, JMM
can be found in app.ppr[ekl,jk]; it is nine lines.
∂11-Aug-81 2254 Feigenbaum at SUMEX-AIM TECHNOLOGY IN THE SERVICE OF SOCIETY
Date: 11 Aug 1981 2252-PDT
From: Feigenbaum at SUMEX-AIM
Subject: TECHNOLOGY IN THE SERVICE OF SOCIETY
To: rindfleisch at SUMEX-AIM, levinthal at USC-ISI, jmc at SU-AI
Mail-from: ARPANET host SU-SCORE rcvd at 11-Aug-81 0437-PDT
Date: 11 Aug 1981 0717-PDT
From: Avron Barr <csd.barr at SU-SCORE>
Subject: [Pettit.PA: Horse racing computer]
To: feigenbaum at SUMEX-AIM
Mail-from: ARPANET site PARC-MAXC rcvd at 7-Aug-81 1923-PDT
Date: 7 Aug. 1981 6:17 pm PDT (Friday)
From: Pettit.PA
Subject: Horse racing computer
To: Barr
cc: Pettit
Read this when you're not in a hurry:
---------------------------
Date: 7 Aug. 1981 4:05 pm PDT (Friday)
From: Reid.PA
Subject: whimsical machine (long msg)
To: Whimsy↑
cc: Reid
Reply-To: Reid
I've always enjoyed whimsical machines, and this week I stumbled across one
that I've just got to tell people about. I fear that I will have to go into a bit of
detail about how the machine works, so those of you who don't enjoy
mechanisms should just move to the next message.
I was visiting a little systems house in Troy, Mich., called Systems Associates.
Primarily they make custom CAD workstations to sell to the Detroit automobile
industry, but their pride and joy was a gambling machine that they had
invented and custom-built for shipment to the Dunes in Las Vegas. It was
temporarily back in the shop, and it ended up being much more interesting than
the machine that I went there to see.
It is a horse-racing machine. It has the usual array of buttons and dollar-coin
slots; there are buttons allowing you to bet "win", "place", or "show" on one of
twelve horses. Sitting atop it is a large-screen color television set that shows
paddock scenes from various famous tracks. Below the color TV screen is an
ordinary computer video monitor that lists the names of the horses (they are
selected from a huge random database) and their horse numbers and odds.
After you place your bets, you hit the "go" button. Suddenly the color TV
screen switches to a picture of a bunch of trumpeters, then a gate lifting, and
finally to a dozen or so horses charging out of a starting gate. This is a real TV
picture, not some computer animation. Each horse is sporting a number, painted
on a cloth draped over his back, and amazingly enough, the horse numbers in
this color TV picture match exactly the horse numbers on the betting screen.
After about 30 seconds, the results of the race are seen on the screen, and of
course it is narrated in the usual racetrack announcer's style. "Winnah by a nose
is numbah 12, Candy Dancer....".
Naturally I suspected a closed-loop videotape and a sleazy scheme wherein the
same horse always won the race and only the numbers changed. So I demanded
that they showed me the insides (they aren't used to having actual computer
people visit, and most visitors are sufficiently amazed by the machine not to care
how it works).
Inside were two MCA laser videodisk players, each outfirtted with a custom
videodisk. One disk had paddock shots and trumpeters, and the other had
30-second swatches of many hundreds of different horse races filmed at the same
track. Both machines had been gutted, and their controllers replaced by an
umbilical cord to a gaggle of Z-80's, which were in turn connected to a Nevada
State Gaming Commision approved randomization box. A random number
generated an index into the horse database (kept on an 8" Winchester); a special
chroma-key picture circuit controlled by a PDP-11/23 located the horse numbers
painted on the side of each horse as they came out of the gate, thereby
determining which horse number was in which lane (the camera angle was such
that they were all visible at once right at the beginning of the race.). Horse
numbers were all in a certain color, and thus they could be located by hunting
the digitized color image for a swatch of that particular color (that's what
chroma-key means) inst
∂12-Aug-81 0357 JMM yet another ..
To: JMC, JK, CLT
CC: JMM
The file appn1.ppr[ekl,jmm] contains the latest proof of append--it is 10 lines
(lines 30:40) of which 3 lines are used in getting the defn of append in
the null and non-null cases.
∂12-Aug-81 1008 FFL
To: JMC, FFL
Prof. Colmerauer called to give you his Flight number. British Airways
287 on August 13. Said if situation continued the flight might be delayed.
∂12-Aug-81 1148 FFL
To: JMC, FFL
∂11-Aug-81 1732 JMC seminar Friday
Please find a room, say 252, for a seminar.
Special seminar: logic programming
Speaker: Alain Colmerauer, University of Marseilles, France (Professor
Colmerauer is the inventor of PROLOG).
Time: 3pm, Friday, August 14
Room 252 is reserved for this seminar on Aug. 15 from 3 to 4:30 p.m.
∂12-Aug-81 1406 JK append
To: JMM, JMC
I did another 9-line proof of append using no sorts - it is in
append.ppr[ekl,jk].
∂12-Aug-81 1427 FFL
To: JMC, FFL
David Poole returned your call. He can be reeached at 415 969 7815
for the rest of the day.
∂12-Aug-81 1521 JMM append
To: JMC, JK, CLT
CC: JMM
JMM - The file appn1.ppr[ekl,jmm] contains the latest proof of append--it is
10 lines(lines 30:40) of which 3 lines are used in getting the defn of append in
the null and non-null cases.
CLT -
A couple thoughts. The derivation of the null and non-null cases for the
definition of append can be viewed as part the general `theory' of append
(useful for proving other properties of append) so really need not
counted as part of the proof of associativity.
Also, it should be possible to `decide' in one step
[using the non-null append equation, the induction hypothesis,
the CAR-CDR-CONS facts and LIST facts]
that (CONS(X,U)*V)*W=CONS(X,U)*(V*W) is true.
(It ammounts to rewriting both sides of the equation until they agree.)
In EKL can you name groups of facts, as well as single ones?
It is often convenient to group axioms (such as the axioms for
S-expressions or Lists) and just refer the to the collection in
invocations of rewriting, simplifying and deciding rules.
JMM -
The file appn2.ppr[ekl,jmm] contains another proof of append which
is lines 31:39. Using the approach that the derivation of nil and non-nil
cases is part of general theory of append the proof is only 6 lines --
line 31(instantiation of listinduction) and lines 35:39.The 2 steps
36:37 are the major steps..I am willing to suggest that further line-reduction
is unlikely.
As suggested by Carolyn it is possible to name groups of facts,and use these
names .I haven't yet done it (poor proving practice)
∂12-Aug-81 1610 Wiederhold at SUMEX-AIM (Response to message)
Date: 12 Aug 1981 1550-PDT
From: Wiederhold at SUMEX-AIM
Subject: (Response to message)
To: JMC at SU-AI
In response to your message sent 12 Aug 1981 1520-PDT
thankd for info. will compare with IBM Giant disks.
Am following up still at low speed with IBM on Giant proposal, but
see no large influx of funds.
Would we go out for external funding on this? I see CSD funds being depleted by
Vax aquisitions.
I believe I could write a proposal that combined fundable new ideas with
service benefits - a good service level would be needed to permit evaluation
of new ideas in File specification and work distribution.
To operate in service mode at least one fill-time professional would be
required though. I am not anxious in taking on any more hardware, and much less
service mode hardware without people. Space is of course also a problem/
I suggest a mezzanine in the music room.
Gio
-------
My proposal is for Ralph Gorin to "take on the hardware". I believe we can
pay for it with Computer Facility funds, and I would prefer to proceed
promptly. From my own point of view, which regards purges and the removal
of old reports from the file system as the primary problem to be overcome,
the file computer would be a big improvement at this price even if all
transfers to it were done by explicit FTP by the user.
Brian Reid has software at SCORE and perhaps on the VAXen that permits
a file computer to be treated like a user disk pack. Something similar
can be done at SAIL. No one has automatic migration yet. Your plan
to store information rather than files (if I understand it) would require
further adaptations. The other schemes mentioned are all compatible with
starting with FTP and maintaining that capability while more advanced
facilities are implemented. I believe that you would also have to work
in that mode. There needs to be a meeting to sort out the various ideas
for file service and see which can be implemented.
My understanding is that the IBM 3380 is going to be substantially delayed,
and there is no present sign of cheap imitations.
∂12-Aug-81 1830 Wiederhold at SUMEX-AIM (Response to message)
Date: 12 Aug 1981 1803-PDT
From: Wiederhold at SUMEX-AIM
Subject: (Response to message)
To: JMC at SU-AI
In response to your message sent 12 Aug 1981 1654-PDT
yes if it is pure service mode for reports etc. then FTP type only service
is warranted. I am interested in more novel things, which would pay off
with higher access frequencies. The 3380 seems indeed delayed. I hear
rumors of competetive devices, which dont use thinfilm heads.
Gio
-------
∂12-Aug-81 2223 JMM the final solution
To: JMC, JK, CLT
CC: JMM
The proof appn3.ppr[ekl,jmm] is a two-line proof (lines 31 and 35) of the
associativity of append
∂13-Aug-81 0625 ZM Search Committee
To: GHG at SU-AI
CC: JMC at SU-AI, DEK at SU-AI, JMC at SU-AI, JEF at SU-AI
I spoke with Tony Hoare at the Marktoberdorf summer school.
He told me he would seriously consider an offer from Stanford.
(He claims that "four years at Oxford is more than enough".)
I recommend that you or Don proceed with this matter. Zohar
∂13-Aug-81 0625 ZM Search Committee
To: GHG at SU-AI
CC: JMC at SU-AI, DEK at SU-AI, JMC at SU-AI, JEF at SU-AI
I spoke with Tony Hoare at the Marktoberdorf summer school.
He told me he would seriously consider an offer from Stanford.
(He claims that "four years at Oxford is more than enough".)
I recommend that you or Don proceed with this matter. Zohar
∂13-Aug-81 0929 FFL
To: JMC, FFL
Do you want the announcement of the Colmerauer seminar mailed to your
Fall Quarter CS 299 mailing list?
∂13-Aug-81 0951 CLT
Don't count on me for supper, I am playing music late this afternoon.
∂13-Aug-81 1042 Sharon.Burks at CMU-10A Distinguished Lecture
Date: 13 August 1981 1334-EDT (Thursday)
From: Sharon.Burks at CMU-10A
To: JMC at SU-AI
Subject: Distinguished Lecture
Message-Id: <13Aug81 133405 SB40@CMU-10A>
I have had a bit of trouble contacting you about the distinguished lecture which
you agreed to give, so have resorted to machine mail (which I probably should
have used in the beginning!).
We would like very much to have you present a lecture in our fall series.
One of the following dates would suit us best:
November 4
November 11
November 18
Of course, if none of these suit your schedule I would be happy to try to work
something else out with you. All of our lectures are scheduled for Wednesday
afternoons at 4:00 PM.
I look forward to hearing from you. It would be helpful if you could also send
me a title, as our poster should go to the printing office soon.
Thanks so much.
Sharon Burks
If Nov. 17 or 19 is feasible, I could combine it with another trip to the
East Coast. Otherwise November 4 is best. The title will be "Non-monotonic
reasoning and ambiguity tolerance".
∂13-Aug-81 1157 DDY your thesis
To: ROD at SU-AI
CC: JMC at SU-AI, csd.dbrown at SU-SCORE,
csd.tajnai at SU-SCORE, MAS at SU-AI
John McCarthy reversed his decision on the AIM #'s--the AIM series of report #'s
WILL continue. Your thesis (STAN-CS-81-861) has AIM #343. Dawn
∂13-Aug-81 1408 FFL
To: "@SEMINA.[1,FFL]" at SU-AI
Professor Alain Colmerauer of the University of Marseilles,
inventor of PROLOG,
will speak on LOGIC PROGRAMMING
on Friday, August 14,
252 Jacks Hall, at 3 p.m.
∂13-Aug-81 1501 FFL
To: JMC, FFL
Les Dugan called to say that the lead for the article will read,
"Support Diablo Canyon"
∂13-Aug-81 1559 100 : Peter Suzman
When packing up, I found a paper of your's that I must have
borrowed some time back - I have left it with Fran. Sorry I did not
have a chance to talk with you before I leave (tomorrow), but I hope
we shall meet again, either here or in Cambridge. Thanks for all your
assistance and best wishes. Peter.
∂13-Aug-81 1703 Konolige at SRI-AI (Kurt Konolige)
Date: 13 Aug 1981 1703-PDT
From: Konolige at SRI-AI (Kurt Konolige)
To: JMC at SU-AI
In-Reply-To: Your message of 13-Aug-81 1659-PDT
Yup, I wanted the Sato thesis. I'll be by tomorrow (Friday)
if you leave it with Fran. --kk
-------
∂13-Aug-81 2038 JK
∂13-Aug-81 1416 JMC
I tried to declare car as a prefix so that the number of parentheses
in formulas would be reduced. It didn't work. The declaration was
(DECL (CAR CDR) |GROUND→GROUND| CONSTANT nil prefix 1010)
but (assume |a = car x|) and (assume |a = (car x)) both generated
the message "expected another op before X". Allowing one variable
functions as prefix operators greatly reduces the parenthesis level
and increases the readability of expressions.
-------------
prefix means in ekl a simple function which is followed by parenthesis;
i.e. car(x)
use unary instead of prefix for the desired effect
∂13-Aug-81 2043 JK
∂13-Aug-81 1433 JMC
(∀e phi |λv.(v=copy(v))| 19) gets ;UNBOUND ARGUMENT MUST BE PROPER LIST
∂13-Aug-81 1437 JMC
The above occurs after dskin of lisp.ax[e81,jmc].
---------------
I tried this and it did not occur: Some of the routines are not
well enough protected against inputting atoms for lists etc
and one gets a lisp error instead of something reasonable -
maybe something was mistyped?
∂13-Aug-81 2049 JK
On commandfiles:
fasload cmdfil.fas[ekl,jk]
The function (mk-cmdfile foo bla bas fuz)
makes (or appends at the end if file exists)
a command file foo.bla[bas,fuz]
(mk-cmdfile foo) defaults to foo.cmd in your directory.
∂13-Aug-81 2154 JK bug fixed
It was a genuine compiler bug - the interpreted code ran fine.
The source of grief seemed to be a or compiled wrong - I added
an and to it and this seemed to trick the compiler to do the right
thing.
Thanks. Perhaps RPG can get something done about the compiler bug.
∂14-Aug-81 0837 Wiederhold at SUMEX-AIM bulk store
Date: 14 Aug 1981 0837-PDT
From: Wiederhold at SUMEX-AIM
Subject: bulk store
To: jmc at SU-AI
Even though I am interested in different, long term and research aspects
of mass storage devices, I would like to stay involved in immediate
concerns. Thanks Gio
-------
∂14-Aug-81 0843 FFL
To: JMC, FFL
I need to get underway on reimbursement for Colmerauer if he is to get
his money on Monday afternoon. So just what expense are we underwriting:
how much airfare, his Faculty Club bill, honararium? I will have to get
this to them this afternoon by 3 p.m.
∂14-Aug-81 0930 FFL
To: JMC, FFL
I have further investigated the method used to reimburse a foreign visitor
by means of a check advance. PBR tells me that they cannot advance money
to a non-employee. We can get a check advance in your name. You agree
to assume responsibility for the accounting of the money. This is fine
but Professor Colmerauer must be sure to give you copies of all receipts
for reimbursable expenses. I have a copy of his ticket, but his living
costs must be accounted for on papers we can forward to PBR. I will go
ahead with this as soon as I know the items you wish to underwrite.
∂14-Aug-81 1039 FFL
To: JMC, FFL
The carpeting in the offices will be cleaned tonight and this weekend.
We are supposed to have all movable material off of the floor during
this period.
∂14-Aug-81 1044 Bobrow at PARC-MAXC AI meeting at IHCAI
Date: 14 Aug 1981 10:39 PDT
From: Bobrow at PARC-MAXC
Subject: AI meeting at IHCAI
To: "@[ivy]<bobrow>ai-board.dl"
cc: Dake, Bobrow
Reply-To: Bobrow
The Artificial Intelligence Journal Editorial Board meeting will be held at IJCAI
on Tuesday morning, 7:30 AM, August 25, 1981, at the Faculty Club at the
University. A buffet breakfast will be available.
The agenda items I have are the following:
1) Getting board approval for correspondents in a number of areas: Each of these
areas overlap with Artificial Intelligence, and have a significant number of
papers of interest to the AI audience appear elsewhere. The job of the
correspondent is to make a selection of titles from recent publications in his/her
area of expertise. These will be listed, with perhaps a sentence or two comment
by the correspondent. I would expect to give the correspondent complete control
over the selection. For producing such a selective annotated bibliography at
least twice a year, I would want to pay each correspondent an honorarium from
Editorial Board funds. At the moment I have agreements from the following
people to act as correspondents in their areas:
Philosophy Dan Dennett
Cognitive Psychology Zenon Pylyshyn
Vision Michael Brady
Robotics Tomas Lozano Perez
Natural Language Barbara Grosz
2) Discussing the relation of the AI journal to other publications in the field.
For this purpose, I have invited Barbara Grosz, newsletter editor for SIGART to
join us for some of the meeting. Lee Erman, of the AI Magazine, of course will
be there as a member of the Board.
3) Discussing current policies of North Holland, for example with regard to
republication rights, and other ways that North Holland can better serve the AI
community through the AI journal. For this purpose, I have invited Willem
Dijkhuis, of North Holland, to join us for some of the meeting. I have requested
that North Holland delegate to the Edtior-in-chief of the AIJ the authority to
grant reprint permissions, and North Holland has been agreed to that -- settling
some of the issues that raised by Jon Doyle.
4) Additions to the board. As AI gets more active, we need more people to help
share the refereeing load. We are currently using some secondary referees from
off the board, but are sticking to our policy of having the primary referee be a
board member. People who I think we should add to the board are Barbara Grosz
and Randy Davis. Other suggestions are welcome, and comments on these two
please.
Please respond to this message, telling me whether you are coming to the
breakfast, and whether you have any further agenda items. Of course, feel free
to bring up any others at the meeting.
Danny
I agree with all your proposals and plan to be at the meeting.
∂14-Aug-81 1553 FFL
To: JMC, FFL
Dan Bobrow returned your call.
∂15-Aug-81 1022 Edward Feigenbaum <CSD.FEIGENBAUM at SU-SCORE> books returned by Hi Yamada
Date: 15 Aug 1981 1016-PDT
From: Edward Feigenbaum <CSD.FEIGENBAUM at SU-SCORE>
Subject: books returned by Hi Yamada
To: jmc at SU-AI
John,
Hi asked me to return three volumes of Russian language material
you loaned to him. I left them on your bookshelf, on top of
The Cyberiad.
Ed
-------
∂16-Aug-81 1836 HEARN at RAND-AI
Date: 16 Aug 1981 1835-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 16-Aug-81 1304-PDT
It is Western 751 arriving SFO at 8:50pm. Pls confirm asap you've received
this.I've just left him at the airport and he is expecting someone to meet
him in SFO.
-------
∂16-Aug-81 2018 HEARN at RAND-AI
Date: 16 Aug 1981 2015-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 16-Aug-81 2015-PDT
Thanks!
-------
Gottim. What's the current financial arrangement?
∂17-Aug-81 0045 Feigenbaum at SUMEX-AIM AAAI COUNCIL MEETING AGENDA
Date: 17 Aug 1981 0043-PDT
From: Feigenbaum at SUMEX-AIM
Subject: AAAI COUNCIL MEETING AGENDA
To: bobrow at PARC-MAXC, buchanan at SUMEX-AIM, feldman at SUMEX-AIM,
jmc at SU-AI, minsky at MIT-AI, newell at CMU-10A, nilsson at SRI-AI,
reddy at CMU-10B, sacerdoti at SRI-KL, simon at CMU-10A, tw at SU-AI,
phw at MIT-AI, engelmore at SUMEX-AIM, erman at USC-ISIF,
aaai-office at SUMEX-AIM, tenenbaum at SRI-KL, athompson at USC-ECL,
walker at SRI-AI
AGENDA FOR AAAI COUNCIL MEETING, AUGUST 24, 1981
PREPARED BY: Edward A. Feigenbaum, President
I. Report items (short)
Report on First National Meeting (August, 1980)
Financial Report (Treasurer)
Report on any remaining start-up bugs
II. Should the AAAI establish a permanent association office?
It is proposed that a small association headquarters
office be established in Menlo Park, Ca.; that Lou
Robinson be hired as an Executive Director; and that
he be authorized to hire a secretary/clerk. Some word
processing peripherals will be needed.
III. Publications (Erman)
Report on AI Magazine and its problems
Announcement of Editor (Engelmore)
Discussion of proposal to centralize production
at the headquarters office
Discussion of Doyle proposal for new publication
IV. Costs of AAAI and Dues
Discussion of budgets and real costs (of publications
and office)
Discussion of gradual dues increase (rising $5/yr. to $25)
V. SIGs and Regional Groups: Do we want any? All?
Discussion of proposal by Shortliffe, et.al. for
a AAAI special interest group in AI-in-Medicine
(Shortliffe, if available)
Discussion of proposal by Ruven Brooks for regional
chapter in the Texas area
VI. LOGO
AAAI logo: problems and possibilities
VII. Other New Business
There are many items to discuss. I hope to run the meeting
crisply, so that we can get out before midnight.
The meeting will take place in the same conference hall in
which the IJCAI keynote speech and the AAAI President's
speech is being given, beginning at 9PM.
The AAAI Business Meeting for all members will be held later
in the week, according to the printed schedule.
-------
∂17-Aug-81 0853 HEARN at RAND-AI
Date: 17 Aug 1981 0841-PDT
From: HEARN at RAND-AI
To: JMC at SU-AI
In-Reply-To: Your message of 16-Aug-81 2332-PDT
You were to contribute $500 as I recall.
-------
∂17-Aug-81 0853 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Guggenheim Fellowships
Date: 17 Aug 1981 0845-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Guggenheim Fellowships
To: CSD-Faculty:
cc: CSD.BScott at SU-SCORE
The announcement for the 1982 Guggenheim Fellowship competition has not
been received. However, the procedures are the same and the deadline for
application is October 1. So this is advance notification!
Applications for Fellowships must be made in writing on or before October 1,
1981, by the candidates themselves in the form prescribed, addressed to the
John Simon Guggenheim Memorial Foundation, 90 Park Avenue, New York, NY
10016. Application forms will be mailed on request. 212/687-4470
-------
∂17-Aug-81 0910 Sharon.Burks at CMU-10A
Date: 17 August 1981 1117-EDT (Monday)
From: Sharon.Burks at CMU-10A
To: John McCarthy <JMC at SU-AI>
In-Reply-To: John McCarthy's message of 13 Aug 81 15:33-EST
Message-Id: <17Aug81 111721 SB40@CMU-10A>
November 17 will work out fine. (I managed to get the room, which is the
largest obstacle!!) The lecture will be at 4:00 PM. We would like it very much
if you would be able to stay another day so that members of the department would
have an opportunity to talk with you. However, if that won't fit into your
other plans we will understand. We will need for you to be at the department
about 3:00, which will require arrival at the PGH Airport by about 1:30.
Thanks so much for your quick response. I look forward to seeing you on
November 17.
Sharon
My other commitment in the East is on the 18th, but I could perhaps
come a day early.
∂17-Aug-81 0910 JMC*
needle Loebner about dialnet
∂17-Aug-81 1002 TW Comprehensive reading list
To: "@COMP.DIS[1,TW]" at SU-AI
The AI section for the Comprehensive Reading list will be replaced by
the following two items:
Barr, A.V. and E.A. Feigenbaum (eds.), Handbook of Artificial Intelligence,
Volume 1. Stanford: Kaufmann, 1981.
Winston,, P.H., Artificial Intelligence, Reading: Addison Wesley, 1977,
Part I (Chapters 1-9).
∂17-Aug-81 1108 TW Comprehensive MTC readings
To: "@COMP.DIS[1,TW]" at SU-AI
There has been a change proposed by John McCarthy for the Comprehensive
Reading List in the area of MTC. He proposes to add the first three
chapters of McCarthy and Talcott (LISP: Programming and Proving) to the
readings and to add the phrase "and proving simple LISP programs correct
by the method of structural induction" to the list of things students
must be able to do.
Before making the change I would like to get feedback from the committee
and the MTC faculty. If I don't hear from you in the next week I will
assume you approve.
∂17-Aug-81 1124 FFL MESSAGE FOR A. COLMERAUER FROM LARRY TESLER
To: JMC, FFL
The meeting tomorrow - Tuesday - will be from 3 to 5 p.m.
∂17-Aug-81 1125 FFL
To: JMC, FFL
Mr. Fowler of SCIENCE magazine called from Washington D. C. asking if
you were interested in reviewing an article for them. Pls. call back
at toll free number, 800 424 9730.
∂17-Aug-81 1144 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Winter Quarter
Date: 17 Aug 1981 1141-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Winter Quarter
To: jmc at SU-AI
You are scheduled to teach CS258 Winter Quarter.
Is 1:15-2:30 satisfactory?
Carolyn
-------
1:15-2:30 for CS258 is fine.
∂17-Aug-81 1144 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) CS258
Date: 17 Aug 1981 1142-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: CS258
To: jmc at SU-AI
John, I meant TTh 1:15-2:30.
-------
That's what I thought you meant.
∂17-Aug-81 1128 Baskett at PARC-MAXC Re: [John McCarthy <JMC at SU-AI>: Poole on file server ]
Date: 17 Aug 1981 11:27 PDT
From: Baskett at PARC-MAXC
Subject: Re: [John McCarthy <JMC at SU-AI>: Poole on file server ]
In-reply-to: CSD.PRATT's message of 14 Aug 1981 1834-PDT
To: Vaughan Pratt <CSD.PRATT at SU-SCORE>
cc: JMC at SU-AI, Reid at SU-SCORE, REG at SU-AI, baskett at SU-SCORE
God damnit, Vaughan! Brian Reid is trying to get this very project done! It is
one of his primary research interests as well as one of his primary system
building interests. He has already put a lot of time and thought and actual
programming work into this project. He is the one who should be in charge,
given his intelligence, good taste, energy, interest and the fact that he is going
to do a better job than anyone else and Stanford will be pleased AND proud of
the result. It is downright ridiculous for the rest of us to continue to leave him
out of this altogether, given that he should be running it. He has said this to
you before. Please listen! Likewise for the rest of you. Stanford can't afford to
waste resources like him.
Forest
---------------
-------
Mail-from: Arpanet host SU-SCORE rcvd at 14-AUG-81 1836-PDT
Date: 14 Aug 1981 1834-PDT
From: Vaughan Pratt <CSD.PRATT at SU-SCORE>
Subject: [John McCarthy <JMC at SU-AI>: Poole on file server ]
To: baskett at SU-SCORE
McCarthy is clearly as concerned as I am about getting a file server
soon. Here's his thoughts on the matter. Are they reasonable?
---------------
Mail-from: ARPANET site SU-AI rcvd at 12-Aug-81 1516-PDT
Date: 12 Aug 1981 1514-PDT
From: John McCarthy <JMC at SU-AI>
Subject: Poole on file server
To: REG at SU-AI, VRP at SU-AI
1. F5 with 256K and ethernet 55-65K.
2. 20K per 670 megabyte disk
3. 30-35K per 125 in/sec 6250bpi tape drive. He'll look into "streaming mode"
drive.
4. delivery could be 4 months from now
later will be 75 days delivery
5. substituting F4 (about 2060 speed), raises basic cost to 125 to 130K
(F4 with megaword, usual peripherals is 300K)
6. will look into bigger disks, claims all RP drives are CDC. He can get
them but sometimes with longer deliveries.
Therefore if a system with 4 gigabytes, the F4, one 6250 bit drive and
256K main memory will do the job, our cost would be $220K. We might
need more memory, and we might want more disk to start. I would prefer
larger disks, and Poole will look into it, but I think this constitutes
an existence proof, so we should proceed promptly to get a decision to
build a file system.
---------------
-------
I did send my message to Brian Reid and had a long conversation with him.
I think we agree about enough things. In my view it is essential to
subordinate the goal of pursuing research interests with that of relieving
the file crunch and give the latter priority for CCF funds. Of course, if
we can't rais facility money and do get a research contract, then the
reverse priority might be required.
However, I think that so long as we implement FTP to the file server
promptly, we can pursue Brian's goal of allowing page-at-a-time reference
to files which is clearly much better. Moreover, Brian is far enough
advanced in the latter and sufficiently sympathetic to the former that I
think there will be no problem. Gio Wiederhold also has research goals in
this area, but because they involve databases and not merely files, it
isn't so clear that they fit into the file server project itself, though
it might be feasible to put some hooks into the file server for his
benefit.
With regard to the conversation with Poole, I think we need one more
thing than was mentioned in my message. While various disks may be
most cost-effective at present, most likely disks based on the IBM
3380 technology will be most cost-effective fairly soon, and others
beyond that later. Therefore, it is very desirable that the file
server have some reserve in the speed of file transfer that it allows.
I will ask Poole to add this question to those he has promised to
look into.
I believe that it is possible to promptly develop a plan that will meet
the various needs. The big issue is whether it is to be financed by
the CCF borrowing from Stanford and adding the amortization and expenses
to the rate base or whether a proposal to ARPA or NSF is required. I
encountered Bill Massy (Stanford V.P. for finance) at Tressidder and
he is agreeable in principle to Stanford financing it. I favor self-
financing, because getting gov't money will take a relatively long time.
∂17-Aug-81 1517 Marvin Minsky <MINSKY at MIT-AI>
Date: 17 August 1981 18:16-EDT
From: Marvin Minsky <MINSKY at MIT-AI>
To: jmc at SU-AI
Yes. Will be good to see you.
∂18-Aug-81 0942 DUFFEY at MIT-AI (Roger D. Duffey, II) HUMAN-NETS Digest V4 #31
Date: 18 AUG 1981 1011-EDT
From: DUFFEY at MIT-AI (Roger D. Duffey, II)
Subject: HUMAN-NETS Digest V4 #31
To: HUMAN-NETS at MIT-AI
HUMAN-NETS Digest Tuesday, 18 Aug 1981 Volume 4 : Issue 31
Today's Topics:
Terminal Design - Noise,
Computers and People - Computerese/Computerish & Hackers in the news,
Teaching reading
----------------------------------------------------------------------
Date: 17 Aug 1981 09:42 PDT
From: Reed.ES at PARC-MAXC
Subject: Terminal noise.
I have been disturbed by this type of noise for many years - I
first realized what it was when I walked into a department store
one day and noticed a bothersome whine. The closer to the TV
department I got the worse it got. I finally realized that it
was the 10 TV's they had on as demos.
I have walked into stores where this noise was so loud, I could
not stand it and had to leave. Yet many people can't even hear
it.
CRTs are not much different from TV's, and I have had similar
problems with them. One particular type of display which I find
very annoying is the Ramtek color display. I cannot go into the
same room with one.
Terminal noise is a serious problem to me, and I think something
should be done about it.
-- Larry --
------------------------------
Date: 17 Aug 1981 1329-PDT (Monday)
From: Lauren at UCLA-SECURITY (Lauren Weinstein)
Subject: flyback oscillators
I have been driven crazy by television flyback oscillators for
years. I am also driven to the point of madness by 20 Khz motion
detector circuits and "silent" dog whistles.
A loud flyback is not necessarily the mark of a "maladjusted"
circuit. Usually the high noise level is caused by the vibration
of the wire laminations on the flyback coil. A "cheap" flyback
is more likely to be in this condition, though I had a new SONY
color television that exhibited this characteristic -- and it
wasn't cheap!
Some television/monitor manufacturers stock selected "quiet"
flybacks which you MIGHT be able to get if you complain loudly
enough. The problem is convincing the television/monitor
technician that you are not crazy -- they usually sit around
these things so long that they cannot hear the flyback anymore
-- even a loud one!
The primary factor controlling high end hearing acuity is age.
The older you are, the more likely you are NOT to be bothered
by flybacks and similar devices. Of course, some people main-
tain full acuity throughout their lives... Another factor that
is important is exposure to loud noises in particular frequency
bands. People who fly in jets a lot actually tend to have
significantly degraded hearing on the high end. Interestingly
enough, listening to loud rock music does not affect the high
end response as much as it does a band more in the middle
hearing ranges.
If flybacks bother you, about all you can do is BE CAREFUL
when you buy equipment. For example, old Ann Arbor terminals
are TERRIBLE -- some can be heard two rooms away! Just make
sure that one of the factors you use to determine a terminal's
suitability for longterm use is its "noise level"...
--Lauren--
------------------------------
Date: 17 Aug 1981 12:12 PDT
From: Kolling at PARC-MAXC
Subject: terminal noise/ intimidate your terminal
To: "ihuxl!jej in care of" <CSVAX.upstill at Berkeley>
Women hear higher frequencies than men on the average, I believe.
I recall reading somewhere a few years back that a new type of
terminal had to be "recalled" after it was initially installed
somewhere. The engineers that had developed and tested it were
male, the first users were female, and the latter dropped like
flies (headaches, etc.) when they started to use the terminals,
which were clustered together in a fairly large bunch. As for
me, I have found a good thump on the side of the display cures
the noise for several hours. Perhaps "my" noise is not due to
"maladjusted terminals' horizontal sync oscillators" though.
Karen
------------------------------
Date: 18 August 1981 07:40-EDT
From: Oded Anoaf Feingold <OAF at MIT-MC>
Subject: terminal noise
I think the problem mentioned is not minor. I think it has
significant bearing on people's work environments and
productivity, and bears some study.
I habitually open buzzing termini and quiet them as much as I
can without compromising their warranties or getting in over
my head. That isn't really a solution but it often palliates
the problem.
Most commonly, there's an transformer (not high voltage) in the
horizontal amplification chain that causes the trouble. You
can do wonders by jamming in a wooden matchstick. Or shimming
it with some plastic (somewhat heat-resistant), or .... Me,
I'm kinda stupid so I usually leave the terminal turned on
while frobbing it. But I have curly hair anyway.
If you can't or mustn't or won't open a terminal, banging the
little sucker (just like TVs at home) often helps. That may
reseat the transformer enough to cut the buzzing. Optimal spot
to kick it varies with the terminal (duh). Here's a freebie -
H19s or H89s are good to kick at the back left corner as you
face the terminal, just at the crack line. In general, one or
two short sharp smacks (or softer, one harder) should be all
you do - if you get too enthusiastic you may run into trouble.
There's no point in pounding the daylights out of a terminal
where the transformer seriously intends to stay at the bad
spot. Unfortunately, the buzzing spot is typically where the
terminal will gravitate to, with relaxation times that may be
quite short. (Surprisingly enough, they are commonly rather
repeatable.)
Also, the buzzing problems are NOT restricted to 15,750 Hz.
Everything in there is mechanically coupled to the rest of
the world, so you can get mixing, harmonices, subharmonics,
.... Admittedly, women/kids/new hackers may be better at
hearing that frequency, but the problem is not restricted to
it. Also, you don't have to know you're hearing a frequency
to hear it. It may merely produce a feeling like your ears
are slightly stoppered, or the room is stuffier some place
than others, or an inexplicable tendency to tension headaches.
Or lots of other malaises, not all of them minor.
Oded
------------------------------
Date: 18 August 1981 02:07-EDT
From: Gail Zacharias <GZ at MIT-MC>
Subject: Computerish -- whose default is it
I think both the original article, and the replies outlining
the "reasonableness" of the terms used miss the point. The
article's attack on the \existence/ of "computerish" was silly.
There's nothing wrong with a specialized jargon. In fact it
is a necessary shorthand. You can't expect people involved in
computer work to go around saying "the thing which appears on
the screen in order to bla bla.." to each other. On the other
hand, there is very definitely something wrong in putting that
jargon in a USER manual. When I buy a vacuum cleaner, I want
the instructions to be in a language *I* can understand. I
don't care if vacuum cleaner designers have a jargon of their
own, but I would object to them assuming that I should know
and understand it just to use their product. Sure, newspaper
people have a jargon. But newspapers aren't written in that
jargon. In fact newspapers are generally pretty good about
explaining specialized terms whenever they use them. Computer
manuals are notorious for just using words and concepts without
explaining them.
------------------------------
Date: 17 Aug 1981 0851-EDT
From: Eric K. Olson <OLSON at DEC-MARLBORO>
Subject: FOO and ITS
I can think of a wonderful replacement for FOO: THING. But my
understanding has always been that FOOBAR (and from them, FOO
and BAR) was a corruption of FUBAR that was six letters long,
just long enough to be a DEC filename (until TENEX and TWENEX
and VMS).
As for the comment that ITS documentation is not readable,
remember that ITS was built by programmers for programmers, not
for people. ITS documentation is enough for the people who need
it, for the most part. Remember, any system in which the top
level is DDT isn't designed for the layman.
The best documentation that I have seen is the new DEC manuals
(VAX/VMS, RT-11) They are comprehensive, readable, and clear.
The worst I have ever seen is an IBM COBOL manual from the 60's.
------------------------------
Date: 18 August 1981 05:16-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: Computerish -- whose default is it
To: REM at MIT-MC
Your suggestion that we think of ways to embarrass journalists
seems to me a supererogatory task.
------------------------------
Date: 17 Aug 1981 1305-EDT
From: GILBERT at MIT-XX (Ed Gilbert)
Subject: Newspaper Jargon: quote without comment
From the Associated Press:
PM News Digest Monday, Aug. 17, 1981
BULLETIN: Owners Now Bullish on Paper's Future
PHILADELPHIA - Eight labor unions have voted to help move The
Bulletin out of the red by BLUE-PENCILING their working agreements
with the newspaper, which had threatened to become the nation's
third big-city afternoon daily to close this month. The result is
a brighter future for the 134-year-old newspaper, and layoffs and
cutbacks for the unions. Slug PM-Philadelphia Paper, new material,
500 words, should stand. Laserphoto PX2.
(emphasis mine)
To be fair, I should note that I believe these summaries are for
their internal use.
Ed Gilbert
------------------------------
Date: 18 August 1981 05:24-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: Hackers
Weizenbaum says they "literally" had to carry a hacker away
from his chair to feed him, and that he, Weizenbaum, parti-
cipated because he feared for the student's health.
Is this case documentable? My suspicion is that it is
imaginary.
I confess my bias; while I gave my talk on Limits to Growth
(my title: The Only Limit Is Nerve) at the Houston AAAS
meeting, Prof. W. was seated in the audience making remarks
to a tall, nice-looking slim-ankled redhead who dutifully
wrote them down. His remarks weren't flattering to my talk,
I learned later when Mrs. Pournelle showed me her notes...
------------------------------
Date: 17 Aug 1981 10:44:25-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
Subject: Re: more on why Johnny can't read
The question here is what is your wife's pupil load? I've
concluded that there are some facets of education for which mass
production methods simply don't work; you have to have the time
(and the will) to ferret out individual problems and make sure
the student gets it right because all subsequent education depends
on this foundation. (I think I've flamed elsetime here about
trying to tutor a 6th-grader who hadn't learned her multiplication
tables.) I spent K-2nd grade at the school that developed phonics
and recall much smaller classes than are traditional in today's
public schools (also no parental expectations that the school
existed simply to keep the kids out of the way). (You may have
seen the film that was made about teaching phonics --- I had a
10-second appearance in that when I was in 2nd grade.) Certainly
building up from smaller units to larger ones is one of the best
ways to "teach kids to think"; this gets obscured in the many
things the taxpayers want the schools to be (the back-to-basics
types are frequently just as bad here as the most wild-eyed
theorists).
------------------------------
Date: 18 August 1981 05:12-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: Re: more on why Johnny can't read
To: cjh at CCA-UNIX
Class size can be important, BUT my mother was a teacher WAY
back when in the 20's in Florida. She, having only an Associate
of Arts degree from Gainesville, didn't know any fancy theory;
but ALL her kids (30 + per classroom) learned to read. "Except
one or two in five years, but those didn't learn anything else
either." (Translation: there were no EMR and TMR special schools
inthose days and the village idiot went to school along with the
others; as indeed was the case with me in Capleville Tennessee
in 8th grade with a 17 year old girl seated at the back of the
room ((two grades to a room; she was by courtesy in 7th grade))
And Doc Lawlor here in LA used to have adult education
classes in Watts where he'd teach ANYONE to read on condition
that they'd help teach someone else; he'd get parents and teach
them so they could teach their children who were NOT learning
in those deliberately smaller classrooms supported by Title One
and other Federal Aid (which specified also that the "latest"
reading methods would be used). And the results of the latest
methods were horrible.
Why come that the illiteracy rate in my mothers time was
about 3% INCLUDING what would now be called EMR and TMR while
today with our more modern methods (and LOrd KNOWS more expensive
methods) we count ourselves fortunate to have "only" 20%
illiteracy on graduation from high school?
------------------------------
End of HUMAN-NETS Digest
************************
∂18-Aug-81 1526 Sgt. Sally <CSL.LAB.Sally at SU-SCORE> Manager: Stanford Computer Forum
Date: 18 Aug 1981 1522-PDT
From: Sgt. Sally <CSL.LAB.Sally at SU-SCORE>
Subject: Manager: Stanford Computer Forum
To: CSD-Faculty: ;
cc: bboard at SU-SCORE, bboard at SU-AI, csl.sally at SU-SCORE
Bill Miller, Director of the Computer Forum, and I (departing
Foum manager) take great pleasure in announcing the appointment
of Carolyn Tajnai to be the Manager of the Stanford Computer Forum,
effective 1 September l98l.
Carolyn brings to this position a wonderful combination of
initiative, self-direction, social grace, stamina (needed especially
at the time of the Annual Meeting), and a remarkable ability to make
both the industrial participants and the Stanford community feel
that she personally cares about their well-being, their concerns, and
their relations to each other.
I am delighted that she has accepted this job. I hope you all
will help her in whatever way you can. I feel I am leaving in you
in far better hands than you've been in so far.
When I return triumphantly some day with a satchel-full of money,
I certainly will see that MY new company becomes one of the active
participants in what I'm sure will be an even larger, more-engrossing
Forum program: all due to Carolyn's efforts.
Carolyn can be reached for the time being at MJ 210 and on SCORE
as CSD.Tajnai.
Sally Burns
-------
∂18-Aug-81 1628 CLT
EVALing
Perhaps if one defines also a (metamathematical) translation of
the relevant class of defuns to recursion equations and
proves a metatheorem about the relation of Eval and the
translations that could be used to guide the simplification
(or even to write a program generating commands if needed).
If the simplifications are individually legal, no metatheorems
need be proved to justify a control strategy for using them.
The results will be correct, and the only question is whether
they are what the user wants.
∂18-Aug-81 1640 CLT
The point of the metatheorem is that it is likely to
provide the necessary strategy, also it will define a
class of programs for which the process can be expected to
succeed.
∂18-Aug-81 1641 CLT
ps -- e.g. this is an informal notion of proofs as programs.
∂18-Aug-81 1831 CLT
alan says yes, fran took care of the reimbursement problem
∂19-Aug-81 1453 CSD.CRANGLE at SU-SCORE return of paper
Date: 19 Aug 1981 1453-PDT
From: CSD.CRANGLE at SU-SCORE
Subject: return of paper
To: csd.mccarthy at SU-SCORE
May I have the paper which I submitted for your course Epistemelogical Problems in AI. I think it was tiitled Formalizing Knowledge of Persons. You said you would mail it to me in the Philosophy Dept.
Colleen Crangle
-------
Yes, I have seen it recently, and I'll send you a message when I've given it
to Fran for you.
∂19-Aug-81 1801 Brian K. Reid <CSL.BKR at SU-SCORE> letterhead
Date: 19 Aug 1981 1757-PDT
From: Brian K. Reid <CSL.BKR at SU-SCORE>
Subject: letterhead
To: jmc at SU-AI
The file [Score]<Csl.Bkr>MCL.PRESS is a press file of a sample letter
in the format we discussed. Please print it and take a peek. If the
format is ok with you, then copy the file JMCLET.MAK from the
same directory <csl.bkr> into whatever SAIL or SCORE directory(ies)
you would like. The sample letter template is in MCL.MSS,
also in <csl.bkr>
Brian
-------
∂19-Aug-81 2241 VRP via Ethernet host 50#300 Lambda calculus talk by Albert Meyer
To: "@SEM.DIS[SEM,VER]" at SU-AI
Albert Meyer will be talking at SRI on an absolutely complete (as opposed to
relatively complete) axiomatization of termination assertions, on Thursday.
He has offered to speak at Stanford on Friday on models of the lambda
calculus, an abstract of which follows in the next message. David Luckham
and I had some concern that IJCAI would eat excessively into the attendance.
However if there is enough interest I will host this seminar on Friday
afternoon. Please let me know now whether you would be likely to attend,
and if I receive a reasonable response I will fix and advertise the time
and place on Thursday afternoon.
∂19-Aug-81 2301 VRP via Ethernet host 50#300
To: "@SEM.DIS[SEM,VER]" at SU-AI
WHAT IS A MODEL OF THE LAMBDA CALCULUS?
by
Albert R. Meyer
Laboratory for Computer Science,
Massachusetts Institute of Technology
Cambridge, Massachusetts 02139
ABSTRACT. Reading through the literature describing the various models of
lambda calculus of Plotkin, Wadsworth, Scott, Stoy, Engeler, Barendregt, Longo,
for example, I felt as though I kept asking, "What is a group?" and kept being
told "Permutations on n letters are a group," or "Zk is a group," but was
never told that a group is simply an algebraic structure with a binary
operation satisfying the well known conditions. It turns out that there is a
general algebraic definition of model for the lambda calculus which is as
simple as the familiar axioms defining a group. (The definition does not
mention lattices, cpo's, categories, or even lambda terms.) The definition is
shown to be equivalent to the natural semantic definition based on
environments.
These definitions of model are consistent with, and yield a completeness
theorem for, the standard axioms for lambda convertibility. We also review a
simple construction of models for lambda calculus.
∂21-Aug-81 0915 FFL Call from E. Bloom
To: JMC, FFL
Panofsky has been accosted by intervenors. He needs facts on Diablo..
1. How many hearings have been held to determine earthquake proofness
of the plant by the NRC?
2. Final statement of the last hearings with respect to the safety of the plant.
E. Bloom asks that you prepare packet and get to Panofsky as quickly as possible.
He will need the material when in gets back from vacation in 2 weeks. Bloom is
now going away.
Please call Dugan about this for me.
∂21-Aug-81 1533 ZM
To: JMC, FFL
Message from E. Bloom saying that Les Dugan said he would get the information
requested by Panofsky, but Bloom asks that you check to see that Dugan has
taken care of it satisfactorily.
OK, I'll check with Dugan.
∂23-Aug-81 0942 RPG via CMU-20C equipment
Were you at this equipment meeting the other day? Are any of us represented
(where us = Formal reasoning? or = AI Lab?) Anythjing happen of interest?
-rpg-
I was on a trip; I hear bad things were proposed and good things neglected.
∂24-Aug-81 0108 LWE NS tape.
To: REG
CC: JMC
I shall send another courier tape around the end of the month
to clean out my growing NS files. May I trouble you again for your
assistance in writing a DUMPER tape for me? (Thank you much!!!)
∂24-Aug-81 1054 FFL CALL FROM JERGEN REID FROM IBM, W. GERMANY
To: JMC, FFL
Inquiring if you have yet mailed to them a copy of your speech for the
University symposium in September. Is going to call again on Monday, Aug. 3l.
∂26-Aug-81 1508 FFL CREDIT CARDS
To: JMC, FFL
SEARS - Have put a stop on the old one. They no longer issue new numbers.
But they have given you a password, "Data", which you will have to
use for the next three months.
CHEVRON - Will issue a new card with a new number. Please destroy the
extra card. Please call 800 642 0262 if you find fraudulent charges
on your next bill.
MACY - Will send out another plate with a new number in about two weeks.
BOOKSTORE - Your new number is 3613. Will send you a new card.
∂26-Aug-81 1518 FFL
To: JMC, FFL
There was a call from Sandia Labs asking for an abstract of your talk for
Sept. 9. I asked her to call back on Monday afternoon but she said she had
to have it early Monday a.m., so I gave her your home phone.
∂26-Aug-81 1825 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) MTC Qual
Date: 26 Aug 1981 1803-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: MTC Qual
To: CSD.DBrown at SU-SCORE, ZM at SU-AI, JMC at SU-AI
Zohar was interested in giving the MTC qual on Sept. 19, but I told him
it was outside the academic quarter and not allowed. Yoni is ready to
take it, but Frank Yellin needs a little more time. So it would be
against Univ. policy to schedule it then. Therefore, Zohar will be
leaving and the MTC Qual will be John's responsibility during autumn
quarter. Zohar gave me a suggested reading list, but indicated that
John wanted to add something from McCarthy and Talcott.
I'll be back on Sept. 14. Please let me know re reading list, John.
Carolyn
-------
∂27-Aug-81 2122 Mark Crispin <Admin.MRC at SU-SCORE> Extended address LISP compiler
Date: 27 Aug 1981 2121-PDT
From: Mark Crispin <Admin.MRC at SU-SCORE>
Postal-Address: 12155 Edgecliff Place; Los Altos Hills, CA 94022
Stanford-Phone: (415) 497-1407
Subject: Extended address LISP compiler
To: System at SU-SCORE
cc: JMC at SU-AI
A new release of ELISP, with a compiler (ELISPC) has been installed.
Documentation is on <ELISP>ELISP.DOC, implementation notes are on
<ELISP>ELISP.CHANGES.
If you don't know what ELISP is, ELISP is an extended addressing version
of Rutgers/UCI LISP allowing for over a million CONS cells; it is also
for the most part as fast or faster than ordinary LISP 1.6.
Comments => Hedrick@RUTGERS with a CC to me.
-------
∂28-Aug-81 0928 FFL
To: JMC, FFL
Louis Peirara called to say that he was not able to come to see you on
Saturday and Sunday. He will try to call you on both of those days.
∂29-Aug-81 1425 REG
∂21-Aug-81 1251 CSD.PRATT@SU-SCORE via Ethernet
Date: 21 Aug 1981 12:43:46-PDT
From: CSD.PRATT at SU-SCORE
Mail-from: ARPANET host SU-SCORE rcvd at 21-Aug-81 1248-PDT
Date: 21 Aug 1981 1243-PDT
From: Vaughan Pratt <CSD.PRATT at SU-SCORE at SUMEX-AIM>
Subject: mailing list
To: equip at SU-SHASTA
I've created a mailing list, equip@shasta, consisting of the seven people
who attended this morning's meeting. I'm sending this message from
Score to establish that you can mail to equip@shasta from Score. I'll
check whether this can be done from Sail.
Vaughan
-------
∂21-Aug-81 1822 reid@Shasta via Ethernet
Date: 21 Aug 1981 18:19:01-PDT
From: reid at Shasta
To: equip
Subject: reformatted table
I Scribe-ified Jeff's message so I could read the table (it came through
without tabs in my copy of the message). Here's the reformatted words:
Culminating an effort begun by Ralph Gorin and a committee from CSD to
probe the needs of the department (and by ``department'' I include the people
in CSL as well), the following sketch of departmental computer and equipment
needs over the next three years has emerged. These items represent our best
estimate of realistic needs; they do not constitute a ``wish list.''
However, it is unlikely that we can find the money to purchase all items on
the list without considerable fundraising effort on our part.
ITEM 1982 1983 1984 TOTAL
Dec 2080: 1@1.2M $1,200 $1,200
Vax 11/780: 4@400K $400 $800 400 1,600
Dolphins: 15@60K 600 300 900
Large-scale File Store 500 500
SUN Stations: 300@5K 500 500 500 1,500
Ethertips: 20@3K 30 30 60
Ethernet 25 25 50
Terminals 100@1K 50 50 100
Laser Printers: 7@30K 90 60 60 210
Total $2,195 $1,765 $2,160 $6,120
Certain items, such as the file store, terminals, SUN workstations, ethernet
cable, and printers are for general consumption of the department. Other items
have been identified with particular research activities. In particular, the
intent is that the Dolphins would be primarily for the use of HPP, as would two
of the Vaxen. Another Vax would be for systems activities, and the fourth would
be available for activities such as TEX, database research, and general
departmental needs. These Vaxen are in addition to proposed purchases for the
Numerical Analysis group and the Robotics group, that will take place in early
1982.
The purchase of a 2080 in 1984 is problematical, depending on our apparent
needs for large-scale time-sharing services once the smaller scale items such
as Dolphins and Vaxen are available to the community of users.
At the present time, we have $150K available from Stouffer for the purchase
of SUN terminals. The $5K price of the SUN's is an estimated average,
reflecting ultimate economies of scale; initial purchases will be higher.
The file store will very likely be part of a McCarthy-Reid research project
into the utilization of such systems. All other items are intended to be purely
service machines.
∂22-Aug-81 1413 pratt@Shasta via Ethernet
Date: 22 Aug 1981 14:08:14-PDT
From: pratt at Shasta
To: equip
Subject: Sun pricing
I think the $5k figure for Suns should be raised to $7k until we know more
certainly that they can be obtained for $5k, which at present is wishful
thinking. The $7k figure is already very low, representing
approximately twice parts cost. The retail price would be in the range $10k
to $15k depending on the company involved (companies vary between 3 and 5
times parts cost for a profitable retail figure, a ratio that depends both on
the organization of the company and the details of the product). A reduction
to $5k would be possible only with a combination of a benevolent manufacturer
and high volume.
∂22-Aug-81 1453 pratt@Shasta via Ethernet
Date: 22 Aug 1981 14:49:42-PDT
From: pratt at Shasta
To: equip
Subject: file store
(Metafact: a log for this mailing list is accumulating in
[shasta]/usr/spool/mail/equip - its first message is Jeff's with Brian's tabs.)
In addition to the $500k for the research project on an intelligent file
server, I would like to see a budget item for a non-intelligent non-research
file server.
Item
10 localnet file servers at $10,000 each for each year. (Hence 30 file
servers after three years.)
Planned construction: 100 megabyte 8" Winchester (first year, larger for
subsequent years), 68K processor board, Ethernet interface, disk controller.
By the time we have a disk controller ready we should be able to get all
these parts for $7000 plus or minus $1000. The small volume permits these
items to be constructed in house, whence the rather low overhead.
My present thinking is to put two on each floor's local net per year,
including the CSL floor in ERL. These file servers would contain files
accessed within the order of a month or two. Files would migrate from file
servers to other local nets:
(a) to be dumped to tape for backup (incremental only, but with each file
being dumped at least twice on separate tapes, on day of creation and two days
later for security)
(b) for archival of old files to free space on the local file servers
(c) on demand by users on other local nets.
∂22-Aug-81 1512 ullman@Shasta via Ethernet
Date: 22 Aug 1981 15:08:53-PDT
From: ullman at Shasta
To: equip, pratt
Subject: Salaries
Our general strategy has been to charge salaries for maintainance of
equipment to CSD-CF and figure the charges into computer costs to be
paid by grants and contracts. While we have not done so in the past,
a faculty member's time spent working for CSD-CF on SUPPORT (not
development) could be factored in. Undoubtedly the total staff cost
for CSD-CF is going to go way up. If a lot of the equipment is paid for
by ARPA, depreciation costs could be down in compensation, so we don't
necessarily overspend our collective computing budgets.
∂22-Aug-81 1512 pratt@Shasta via Ethernet
Date: 22 Aug 1981 15:03:18-PDT
From: pratt at Shasta
To: equip
Subject: Salaries
We need to estimate salary requirements to maintain all this equipment.
We need at least a couple of technicians for repair work on Suns, and there
should also be someone in charge of Vaxes and Dolphins, if not two people.
In addition I seem these days to be making the coordination of production of
equipment a full time activity, and therefore an appropriate percentage of my
Stanford salary should come from funds allocated for equipment-related
salaries. (The NSF is down to 10% during the academic year for us
theoreticians these days.)
∂23-Aug-81 0133 reid@Shasta via Ethernet
Date: 23 Aug 1981 01:23:52-PDT
From: reid at Shasta
To: equip
Subject: file server
$500K was John McCarthy's figure for a non-research file server
consisting of a Foonly F5, 3 big disks, and a fast magnetic tape
subsystem. I am very dubious of budgeting for file servers
built out of 68000's unless we budget a full-time programmer
to make them work reliably.
∂23-Aug-81 1207 GABRIEL at CMU-20C Hardware
Date: 23 Aug 1981 1458-EDT
From: GABRIEL at CMU-20C
Subject: Hardware
To: reg at SU-AI
I notice that there was a hardware meeting to ask, again, the question
of what the dept needs. Since I was on "that" committee before,
I would like to make a few comments related to the LISP computing
needs of the community, of which HPP is a part.
First, the Common Lisp dialect will run on the following machines:
VAX-n, S-1, PERQ (extended) and LISP Machine. The Lisp Machine
version will be existent firt, then the PERQ, then S-1, then VAX.
I think that if we are going to buy Dolphins (to cover HPP needs only,
which questionable coverage for a dying language) then I think we
need Lisp Machines too in order to give the dept Common Lisp coverage.
In case you don't know what Common Lisp it, it is the merger of S-1
Lisp, VAX NIL, SPICELISP, and Lisp Machine Lisp (Alphalisp), a
descendent of MacLisp. This dialect will surely dominate the next
10 years Lisp usage, and may, in the future, incorporate InterLisp.
I would recommend that the purchase of Dolphins be reduced and
some number of Symbolics Lisp Machines substitute. If HPP wants
to buy them, that's fine, but I don't see the department's need
for Dolphins to the exclusion of LISP Machines, given the existence
of COmmon Lisp.
-rpg-
-------
∂23-Aug-81 1216 pratt@Shasta via Ethernet
Date: 23 Aug 1981 12:11:25-PDT
From: pratt at Shasta
To: equip, reid
Subject: file server
From reid Sun Aug 23 01:23:12 1981
To: equip
Subject: file server
$500K was John McCarthy's figure for a non-research file server
consisting of a Foonly F5, 3 big disks, and a fast magnetic tape
subsystem. I am very dubious of budgeting for file servers
built out of 68000's unless we budget a full-time programmer
to make them work reliably.
1. The Sun project already has some very good programmers. If they can't
produce file server software it will be the first time I've seen something
lick them. More generally the whole issue of software for the Sun should be
treated by this committee as internal to the operation of the Sun project.
The committee should not feel obliged to find funding for Sun software
separately from finding funding for the Sun project as a whole. (Since the
purpose of the Sun project is to develop equipment for Stanford, it seems to
me that an equipment committee should give some thought to contributing to
the funding of the development aspects of the project.)
2. Sun software is written in C. This substantially eases the task of
developing and maintaining systems software, as well as contributing to its
reliability.
3. A set of decentralized file servers is inherently more reliable than a
single centralized file server in two ways: a malfunction of one file server
affects only a fraction of the users, and redundant copies of files may be
maintained on separate machines as opposed to merely separate cylinders or
separate disks. Thus I predict that it will not require a giant software
effort to get decentralized file servers up to an acceptable level of
reliability.
4. The present Ethernet organization will continue to work only for as long
as it remains lightly loaded. We are firmly committed to moving to a
localnet organization of the Ethernet as soon as possible. Local file
servers are an essential component of this reorganization; neither gateways
nor the CSD Ethernet spine will support the load that a centralized file server
would impose.
5. I am not proposing Sun file servers instead of a centralized file server
but in addition to one. The former will have a longer lead time than the
latter - I know for certain that the Sun project does not presently have the
resources to produce the necessary hardware before February at the very
earliest. Instead I envisage that an initial centralized file server will
gradually be phased into a more archive-oriented file server as soon as
localnet file service appears and starts being used. (You were wondering
perhaps where I was going to put the month-old files I said would migrate off
localnet file servers.)
On the other hand I do not endorse the F5, primarily for software reasons - I
predict that it will be a software maintenance headache in the long run. My
objections would be less vehement of if we could run most of the same software
on the F5 as on Vaxes and 68000's. A major reason for our having a large
amount of 68000 software is that it was ported with little effort from Vax and
PDP-11 software. Moreover we maintain increasingly more Vax and Sun software
as a unit; changes are made to one source, and tested on both machines. This
helps us substantially in getting along with the present level of software
personnel. Thus I would strongly recommend that any file server we acquire
be able to run all software that runs on both the Vax and the Sun.
(Inevitably there will be machine dependencies, but these are routinely taken
care of with compile-time conditionals in the case of Vax and Sun machine
dependencies, and the same will apply to other machines.) For the F5 to fit
this requirement it would have to support C - to be exact the version of C
running under Berkeley Vax Unix, which is what we have recently moved Suns to
for maximum portability.
My preference for a centralized file server processor would be a 32-bit
machine with speed and pricing on the same scale as the F5 and offering C.
The above is not meant as an unconditional endorsement of C as a programming
language, but rather is based on the needs of our present software
development and maintenance environment. C has more failings than I like to
think about.
6. This is not the sort of item that would bring the budget to its knees,
for the first year we're only talking about 20% of the proposed cost of a
centralized file server. (My prices are based on estimates of 100 megabyte
Winchester pricing for 1982, today it would be more than double. Price per
bit on small Winchesters is falling very rapidly.)
∂23-Aug-81 1217 GABRIEL at CMU-20C Common Lisp Blurb
Date: 23 Aug 1981 1508-EDT
From: GABRIEL at CMU-20C
Subject: Common Lisp Blurb
To: reg at SU-AI
Here is the description of Common Lisp to be given out at IJCAI:
@make [text]
The following is a DRAFT of a blurb to be distributed at the IJCAI.
A common subset of Lisp, called "Common Lisp", is being defined by the
designers of several new Lisp dialects, to provide portability among the
different dialects.
Several dialects of Lisp descended from Maclisp are in various stages of
development:
@begin [itemize]
Spice Lisp is being developed as a part of the SPICE personal computing
project at Carnegie-Mellon University (C.M.U.). The first implementation of
Spice Lisp, for an extended version of the PERQ computer from Three Rivers
Computer Corporation, is currently under way.
NIL (New Implementation of Lisp) is being developed for the S-1 computer
at Lawrence Livermore National Laboratory (L.L.N.L.) and for the Digital
Equipment Corporation VAX at the Massachusetts Institute of Technology
(M.I.T.). It is partially operational on both machines.
Alphalisp, on the M.I.T. Lisp Machine, has been in use for several
years.
@end [itemize]
All of these dialects are descendants of MacLisp; a great deal of
improvement, modernization, and development has occurred in each of them.
Until recently, development of each dialect was done by the maintainers
of that dialect, without much interaction with the maintainers of the
other dialects. Observers in the Artificial Intelligence community
rightly pointed out that this was leading to a group of incompatible
languages.
Representatives for each dialect are working on the definition of "Common
Lisp". Common Lisp is a powerful and modern Lisp dialect of which SPICE
Lisp, NIL, and Alphalisp are supersets. By writing a program within
Common Lisp, the programmer is assured that it will work in any of these
dialects. The effort is being led by Guy L. Steele Jr. and Scott Fahlman
of C.M.U.; Richard P. Gabriel of the Stanford Artificial Intelligence
Laboratory and L.L.N.L.; Jon L White of M.I.T.; Richard Greenblatt of
L.M.I., Inc., and M.I.T.; and David Moon and Daniel Weinreb of Symbolics,
Inc., and M.I.T.
Common Lisp will be be a complete and usable language in its own right,
and it will be well-supported by all of the above-mentioned
dialects; the participants are all committed to providing and maintaining
support for the entire subset. Common Lisp will also be very stable:
additions to the definition will only be made if there is general
agreement among all participants that such an addition should be made,
and incompatible changes will be avoided. New Lisp language features
that are still considered to be under development will not be added to
Common Lisp; only stable and well-tested features will be added.
A preliminary specification of Common Lisp is expected to be available
by about January 1982 from the Department of Computer Science at
Carnegie-Mellon University.
I hope to return within 2 weeks to Stanford, and would be happy
to discuss how these Lisp developments might affect Stanford's
policy towards hardware acquisitions.
-rpg-
-------
∂23-Aug-81 1537 reid@Shasta via Ethernet
Date: 23 Aug 1981 15:33:13-PDT
From: reid at Shasta
To: equip, pratt
Subject: file servers
I find a bit of an inconsistency in the following two (excerpted) messages:
From pratt Sat Aug 22 14:49:09 1981
To: equip
Subject: file store
In addition to the $500k for the research project on an
intelligent file server, I would like to see a budget item for a
non-intelligent non-research file server.
From pratt Sun Aug 23 12:09:42 1981
To: equip, reid
Subject: file server
3. A set of decentralized file servers is inherently more
reliable than a single centralized file server in two ways: a
malfunction of one file server affects only a fraction of the
users, and redundant copies of files may be maintained on
separate machines as opposed to merely separate cylinders or
separate disks. Thus I predict that it will not require a giant
software effort to get decentralized file servers up to an
acceptable level of reliability.
To my way of looking at things, the construction of something that nobody
has ever successfully done before is a research project. It is not enough to
know how to do something. I know how to build the world's finest document
preparation system; I know how to build fantastic distributed operating
systems and even more fantastic computer message systems. But I haven't done
any of these things yet, and neither has anybody else, and therefore I call
them research projects. Nobody has ever succeeded in building a reliable
fast distributed file system out of any brand of computer, and therefore by
my definition of a research project the 68000-based systems that you are
talking about is a research project.
The only file systems that have ever been constructed by anyone anywhere
that actually work, that are fast, that are reliable, and that are
inexpensive, are centralized file systems. I therefore assert that your
statements of desiring a non-research non-intelligent file server and of
desiring a distributed file system are mutually contradictory.
Naturally I support the distributed file service; naturally I am opposed to
having any kind of software built around a dinosaur of a machine like the
Foonly. Naturally I support your claim that the only sane way to program a
file server is in C on a 32-bit machine. I am only jumping on you for your
unstated belief in the equivalence of software that you think you know how
to write and software that has been written and is known to work.
Brian
∂23-Aug-81 2029 pratt@Shasta via Ethernet
Date: 23 Aug 1981 20:22:15-PDT
From: pratt at Shasta
To: equip, reid
Subject: file servers
Seems to me Brian and I are in perfect agreement. I retract my statement that
distributed file servers are not a research project. Yet another reason to
build them.
∂23-Aug-81 2014 pratt@Shasta via Ethernet
Date: 23 Aug 1981 20:13:39-PDT
From: pratt at Shasta
To: Equip@SHASTA, REG@Sail
Subject: Symbolics Lisp Machines
Dick Gabriel has a point. I'd stopped thinking about Lisp Machines because
they were so expensive, but the Symbolics 3600, successor to Symbolics' LM-2
Lisp Machine, with deliveries beginning March, at $60k in quantity, is
comparably priced to a Dolphin, and as Dick says runs the Lisp that is likely
to dominate the coming decade. More significantly, Symbolics claims that the
speed of a Symbolics 3600 is approximately that of a 2060 running Lisp, which
makes it from two to three times faster than a Dolphin. Although the Dolphin's
microcode has been tuned for Lisp, the Symbolics 3600 is a pedigreed Lisp
machine from the ground up. In light of this fact, an order for 15 Dolphins
merely to satisy the Lisp community sounds to me like a big mistake.
∂23-Aug-81 2351 pratt@Shasta via Ethernet
Date: 23 Aug 1981 23:50:25-PDT
From: pratt at Shasta
To: equip
Subject: msg from rpg
Here's a message from Dick Gabriel, at CMU now but returning in 2 weeks.
From GABRIEL@CMU-20C Sun Aug 23 22:35:32 1981
Mail-from: ARPANET host SU-SCORE rcvd at 23-Aug-81 2234-PDT
Mail-from: ARPANET site SU-AI rcvd at 23-Aug-81 2230-PDT
Date: 24 Aug 1981 0129-EDT
From: GABRIEL at CMU-20C
Subject: Response etc
To: vrp at SU-AI
Vaughn, can you please send this on to the equip mailing list.
There appears to be no way to get this to them via CMU(!).
Also, can you put me on that list? I was on that committee
before, and I think I ought to be on it now (between you and me).
Thanks.
---------------------------
In response to Ullman's message about LISP computing, I would like to
first point out that a very large percentage of the research that
goes on in the department that isn't theoretical is done in LISP. Such
groups are: HPP, Formal Reasoning, Hand-eye, and some of Zohar's students
(YM). In addition, much of the Verification work is done in LISP.
I believe several of these groups have some funding from ARPA.
Thus, the machine of choice that can execute LISP code is nearly
as fundamental as the machine of choice to run file servers.
Second, to buy Dolphins for HPP, which run essentially only
InterLisp, and to then ignore the needs of the rest of the LISP
community seems highly inconsistent. This is especially true
when 25% of the HPP projects use a non-InterLisp LISP (quoted
from Genesereth at the SRI LISP Meeting of last April).
Third, there are enough recent developments in the LISP community
that would influence the direction of LISP computing that I think
to buy a group of machines to (inadequately in my opinion) serve
a small community, when that group of machines may not be the most
forward thinking in terms of long term trends would be folly.
Fourth, the group of people, Feigenbaum, McCarthy, Buchanan,
and Rindfleisch do not represent the greatest expertise in LISP
and recent developments available in the department at this time.
Again, I would like to point out that the Common Lisp effort,
which I believe is unknown to the group of people thus far gathered
to investigate the issues, represents an important enough development
that it ought to be taken seriously.
I am currently at CMU working on the definition, design, implementation,
and documentation for Common Lisp. In 2 weeks I will return and
join the Formal Reasoning group, and at that time I would be more
than happy to help assess the relative merits of hardware for
LISP programming.
As far as LISP on a VAX in concerned, I have talked to Larry Masinter,
Jonl White, and several Franz users at CMU. In addition, I have
chatted with Len Bosack and all have essentially agreed that the
Vax represents a technically uninteresting alternative to the 10-like
computers except insofar as address space in concerned. The ISI VAX
InterLisp will not sustain a software development project (according to
Masinter)in InterLisp, nor will a NIL (read Common Lisp) do much better
except in some numeric code. Franz is barely usable as it is and
more than 1 Franz user on a 780 is sufficiently intolerable to drive
all but one LISP job off the machine. In short, the paging characteristics
render the VAX of any species at or below the 780 level untenable.
If anyone is seriouslyt considering buying some VAXes for LISP,then
a purchase of n/8 where n is the number of LISP users in the department
seems about right to me - 10 should do. I seriously doubt that a
750 would be tolerable even as a personal Lisp machine.
On an unrelated topic, there is an interesting development at CMU
relating to terminals: Leonard Zubkoff's data compression techniques
at the terminal/computer boundary. It has been observed that Concept-100's,
over a 9600 baud line have been driven at the effective rate of
36Kbaud (that's right, thirty-six kilo baud). As much as we would all
like to own the 320i's of terminals, I believe that the department ought
to supply the masses with reasonable, but cheap terminals. This I think
is in contrast to a medium number of high-quality terminals and a medium
number of non-existent ones.
-rpg-
-------
∂23-Aug-81 2354 pratt@Shasta via Ethernet
Date: 23 Aug 1981 23:52:14-PDT
From: pratt at Shasta
To: equip
Subject: rpg
As you can see, Dick has a point of view about Lisp that is not adequately
represented on the committee. I think the majority of his views are
technically sound. He says he was on this committee's predecessor, and would
like to contribute to this one too. What's the vote?
∂23-Aug-81 2118 ullman@Shasta via Ethernet
Date: 23 Aug 1981 21:17:02-PDT
From: ullman at Shasta
To: equip
I'm pleased to find all my colleagues so busy on a Sunday night. I've
found it the best time to get something done, ever since they moved WKRP
to Monday.
Anyway, I would like to run a few propositions by you, and see if we have
agreement.
1. Our committee's role is to come up with an equipment purchase plan.
The amount we propose to ARPA and others will not include maintainence.
Those charges will be collected from one or more contracts as needed.
The paradigm is the way CSD-CF works, or perhaps the way maintainence
for Shasta and Diablo are included in the Baskett and Feigenbaum ARPA
contracts, resp. We must be careful, of course, not to buy anything we
cannot afford service for.
2.
2. We ought to get a little more specific on what the .5M for a file
server will buy. I think Mccarthy, Pratt, and Reid ought to confer
first and report to the committee on the 4th.
3. While we are making up a plan for the whole department, our immediate
concern is what to propose to ARPA. It seems appropriate that the
component of equipment that comes from ARPA should be as close as possible
to the contracts we now have with ARPA, especially if the proposal is
formally a supplement to existing contracts. Thus we should probably
be asking for HPP's equipment, the file server, and SUN-related stuff.
4. The issue of the equipment on which to run LISP is primarily a matter
for the users of that language, provided their requests are not so
extreme that it crowds the rest of the department's needs out.
I don't pretend to understand the relative merits of Dolphins, Symbolics,
or others. I think that as a first crack, Engelmore and Rindfleisch
should get together with McCarthy, Feigenbaum, and Buchanan, to try
to make a decision in this area, also with an eye toward reporting to
the committee on the fourth.
∂24-Aug-81 1402 ullman@Shasta via Ethernet
Date: 24 Aug 1981 13:51:21-PDT
From: ullman at Shasta
To: equip
Subject: Dick Gabriel
I suggest that we ask Dick to join the committee.
I would like to know from those who did study the matter at the beginning of
the year whether it was determined that there were different communities
of LISP users that had incompatable hardware needs.
Despite what RPG claims, it seems that LISP users in the department are
in a substantial minority (remembering that "department" includes CSL).
We right now are talking about 15% of our equipment budget DEDICATED to
this one language. If the 15 Dolphins or equivalent are not going to
serve the entire LISP community, are we going to have to raise that percentage
substantially?
∂24-Aug-81 1734 pratt@Shasta via Ethernet
Date: 24 Aug 1981 17:34:09-PDT
From: pratt at Shasta
To: equip
Subject: solicited input
Here's a solicited input from Jeff Mogul. I wonder to what extent Dick
Gabriel's concerns about the 780 not being adequate for Lisp would be
met by a larger Vax.
From mogul Mon Aug 24 11:41:31 1981
To: avb pratt
Subject: committee report
I have one comment on the Vaxen in your proposal:
The proposed purchase of a 2080 reflects (I presume) a desire to
buy DEC's most powerful model in the 20 product line, in spite
of the fact that they are somewhat of an unknown. I suggest that
rather than buying 4 11/780s within the next three years, we buy
one or two 780s and attempt to buy the forthcoming larger Vax
when it becomes available. My experience with DEC's pricing
policies is that it will give more "bang for the buck" than
a 780 when it is introduced. I suspect especially that it
will allow a larger complement of physical memory (currently
the 780 is limited to 8Mb [or 12Mb with 4Mb of dual-port memory],
and the 750 is limited to 4 (2?) Mb.) For properly-written
VLSI and AI software, this could be an advantage.
-Jeff
∂24-Aug-81 1800 REG@Sail via Ethernet
Date: 24 Aug 1981 1756-PDT
From: Ralph Gorin <REG at SU-AI>
To: Equip at SHASTA, (sunet) at Sail
I agree that the new larger Vax (named Venus) will be more cost-effective
than the 11/780. However, Venus is further behind schedule than the 2080;
we'll be fortunate to see it in '85.
The 2080 is not a totally unknown quantity: its prototype IBOX is running.
It looks quite promising. The 2080 will IMPLEMENT 30-bit virtual
addresses (word addresses). It will probably be available with 4 Million
words of physical memory, with 16 M word versions available when 256K
chips are ready.
∂24-Aug-81 2203 pratt@Shasta via Ethernet
Date: 24 Aug 1981 22:01:56-PDT
From: pratt at Shasta
To: equip
Subject: msg 2 from rpg
Date: 25 Aug 1981 0015-EDT
From: GABRIEL at CMU-20C
Subject: Response to Ullman (part II)
To: equip@shasta at SUMEX-AIM
cc: gabriel
My estimate is that 40% of the users of computers at Stanford
who program (as opposed to edit only) are LISP users. First,
there is HPP, which accounts for 20 (?) LISP users, 25% of
whom do not exclusively use InterLisp (the only thing that
Dolphins run). Formal reasoning has about 10 people, all of whom
use a non-InterLisp. Hand eye has 6 or so non-InterLisp users.
There are 6 random Ph.D students (approx) who use one Lisp
or another. Kaplan's crew uses InterLisp and accounts for
3 people (?). Verification (CSL) uses MacLisp and has 3 or 4
active users. The S-1 (non-ARPA) uses MacLisp for NIL development.
A good rule of thumb is to estimate the proportion of ARPA contracts
doing AI to those that don't, and assume that 95% of the AI people
use Lisp exclusively and 5% of the non-AI people use it extensively.
Having maintained MacLisp at SAIL for 6 years, there is a constant 20
user community at any given time on SAIL. 206 is nearly always taught
using MacLisp rather than InterLisp.
I can state unequivocally that 15 Dolphins will be a boon to HPP and
virtually worthless to the rest of the LISP community, and the
non-InterLisp community is at least as numerous as the InterLisp.
Vaughn pointed out that the Symbolics Lisp machine is a substantial
performance leader over the Dolphins, and there is the distressing
fact that the Dolphins strictly run Lisp, while the Lisp Machines
run a total system with editors, network servers, mail servers,
document compilers and the like.
However, let me be clear on this: HPP needs those Dolphins, even
if just as a stopgap measure. We all face address space limitations
and the Dolphins give a few precious bits of address. The VAXes
will not be able to run development InterLisp jobs (Masinter Report).
HPP uses InterLisp. THerefore they need them now. The rest of us
(50%) do not need these machines and they are worhtless for our purposes.
The reasons that we cannot use them include such things as the fact that
they only run InterLisp, but range to such taste oriented things as an alien
programming style and environment to such technical points as horrendously
slow boxed number arthmetic, slow function call, and the arcane, useless
spaghetti stacks.
My guess is that 30% of the total user community uses Lisp and that 15% of the
budget is too low. And, Lisp Machines are general purpose insofar as
editting etc go.
However, my own personal bias is away from personal machines, at least
as envisioned and/or configured these days. I would prefer to see
a fair amount of money go into a very large machine that will be able
to run Common Lisp (and InterLisp) well and with absurd speed. Moreover,
I do not wish to see all of our timesharing machines burdened with
outdated and unfriendly user interfaces such as what TOPS-20 and
Unix offer at the moment*. Bizarre as it may seem there are one or two
minor features of WAITS that make it quite usable, and cause those
of us forced to use other systems (like the ones at CMU) to wail
in utter despair. Of course, the SUN terminals will (or should) have
screen editors locally so that one never has to retype something
nearly correct.
So, I hope that there is room in the considerations for a general
purpose machine (stock hardware) that is amenable to Lisp and
is usable in and of itself. One possibility (remote, slightly,
and expensive) is the S-1, which, if it ever makes it outside
of the dreams of men, will outclass anything else around by far.
-----------
*Unix is elegantly programmable and can achieve wondrous things,
but so is/can TECO (since you can derive EMACS from it). But, would
you be happy to have a TECO without EMACS, just with the knowledge that
EMACS could exist?
-------
---------------
-------
∂25-Aug-81 1410 pratt@Shasta via Ethernet
Date: 25 Aug 1981 14:05:51-PDT
From: pratt at Shasta
To: equip
Subject: 2nd mogul input
>From mogul Tue Aug 25 11:47:39 1981
To: avb pratt
Subject: committee report
I don't have direct experience with Vaxen running large lisp jobs,
but I think RPG's concern needs some examination.
"Is the Vax inadequate to run more than about one Lisp job at a time?"
Well, even the Cray-1 cannot provide complete service to two
simulataneous CPU-bound jobs, if that is the criteria being used.
Further, an 11/780 is not going to provide as much compute power
as a KL-10A.
The more important issue is, "does the operating system on the
Vax (i.e., Unix) degrade badly under the load of several large
Lisp jobs?" I think the answer here is a qualified "yes", the
qualification being that I don't think anyone has released a
lisp that really interacts properly with the Vax architecture
and secondly, that UCB is promising to improve the memory management
facilities so that, e.g., they will not try to maintain a working
set when Lisp is doing a non-compacting GC.
-Jeff
∂29-Aug-81 2139 TOB
To: JMC, TOB
John
Gene Golub asked me whether, as adjunct professor,
I think that I am being
paid enough, slightly too little, or quite a bit too
little. I don't have comparative figures on which to base this
but I think that I should be getting quite a bit more,
at least I want quite a bit more. Can you take a few minutes
to talk with me about this, and can you suggest how I can get
figures to allow me to support a reasonable salary figure to you.
Gene will talk with you soon, and suggested that I talk with you first.
Best regards,
Tom
∂29-Aug-81 2223 Jerry E. Pournelle <POURNE at MIT-MC>
Date: 30 August 1981 01:23-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
To: jmc at SU-AI
John-- can you forward this? I understand this chap is a student
in your dept. He made a very attractive offer to L-5, and it
was not followed up, although it should have beenm. Now it's a
bit hard to locate him.
Thanks,
Jerry
-----------------------------------------------------
Date: 29 Aug 1981 2220-PDT
From: The Mailer Daemon <Mailer at SU-SCORE>
Message failed for the following:
JPTM at SU-SCORE: No forwarding entry
------------
Mail-from: ARPANET site MIT-MC rcvd at 29-Aug-81 2217-PDT
Date: 30 August 1981 01:16-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: establish communication?
To: JPTM at SU-SCORE
I have recently been told that you have made an attractive offer
to L-5. There has been a recent Board resolution allowing that.
It was only today that I learned about all this.
New L-5 officers includeArthur Kantrowirtz as Chairman, and
Phil Chapman as President. Operations will be divided between
Mark Hopkins and myself until we are finished with the new
Membership Drive, which is already showing great signs of
success. We are doing test mailings, and when we know what is
effective we can mail to a LOT if we have the capital.
JMC can tell you about other L-5 activities which have been very
effective.
Hope to hear from you.
-------
There is no JPTM at SCORE. The only person who might have made
"an attractive offer" to L-5 that comes close to your description
is Jim McGrath, who is known as JPM. He is away to the summer, but
I'll send him a message asking if it's he.
∂31-Aug-81 0832 ADMIN.LIBRARY at SU-SCORE avtomatika i Telemekanika
Date: 31 Aug 1981 0831-PDT
From: ADMIN.LIBRARY at SU-SCORE
Subject: avtomatika i Telemekanika
To: jmc at SU-AI
I don't see where anyone close by has either the Russian or English, Automatic
Remote Control. This title sounds more appropriate for the Engineering Library.
If you think people here at Stanford will need access to the journal, send
it to me and I will consult with the head of engineering. Harry Llull
-------
For Harry Llull:
I have no special opinion about who will read the journal. They send it to
me free (in Russian), but I haven't found anything appropriate to my
interests. If any Stanford library is interested I can forward them.
Otherwise I'll write them to stop sending it. I'll send you an issue.
∂31-Aug-81 0902 Stan at SRI-AI Re prolog
Date: 31 Aug 1981 0904-PDT
From: Stan at SRI-AI
Subject: Re prolog
To: jmc at SU-AI
cc: admin.mrc at SU-SCORE, stan
Probably a good person for Mark Crispin to contact would be Harry Barrow
at Fairchild, since it was Harry who recently put up a version on the KL
which was subsequently moved to SRI-AI. I don't know if this is the
version David was referring to. One Saturday when David & Fernando were
at SRI, they were trying to put up prolog. I told them that Harry had
recently installed prolog. They tried it out & were surprised to find
that it was a recent version. Now I'm not sure whether they went ahead
and installed a still more recent version or not.
Anyway, if I can be of more help, let me know. --Stan
N.B. Another person Mark may want to contact: Steve Dougherty (SAD@SRI-KL).
-------
∂31-Aug-81 0915 Stan at SRI-AI More prolog info
Date: 31 Aug 1981 0917-PDT
From: Stan at SRI-AI
Subject: More prolog info
To: admin.mrc at SU-SCORE
cc: jmc at SU-AI, stan
After sending the last message, I took a look at the <PROLOG> directory.
This is what I found:
[PHOTO: Recording initiated Mon 31-Aug-81 9:07AM]
Link from STAN, TTY 61
TOPS-20 Command processor 3A(37)-3
@V <PROLOG>
PS:<PROLOG>
DEBUG.MEM.1;P775200;P 22 56025(7) 12-Jul-81 20:36:12 PROLOG
GUIDE3.MEM.1;P775200;P 36 91005(7) 12-Jul-81 20:36:30 PROLOG
PATCH.MAC.1;P775200 1 55(7) 17-Aug-81 10:34:49 WARREN
.2;P775200 1 57(7) 17-Aug-81 10:35:57 WARREN
.3;P775200 1 80(7) 17-Aug-81 10:38:40 WARREN
.REL.3;P775200 1 25(36) 17-Aug-81 10:38:52 WARREN
PLC.CCL.1;P775200 1 310(7) 29-May-81 07:55:00 WARREN
.2;P775200 1 177(7) 17-Aug-81 10:16:38 WARREN
.3;P775200 1 238(7) 17-Aug-81 10:18:51 WARREN
.4;P775200 1 222(7) 17-Aug-81 10:24:56 WARREN
.5;P775200 1 222(7) 17-Aug-81 10:26:51 WARREN
.6;P775200 1 233(7) 17-Aug-81 10:37:27 WARREN
.CMD.1;P775200 1 90(7) 14-Sep-78 13:10:00 WARREN
.EXE.1;P775200 65 33280(36) 26-Apr-79 07:46:00 WARREN
.EXT.1;P775200 1 240(7) 14-Sep-78 13:20:00 WARREN
.FNS.1;P775200 3 7320(7) 14-Sep-78 13:12:00 WARREN
.LIB.1;P775200 114 58334(36) 15-Sep-78 11:48:00 WARREN
.MIC.1;P775200 1 485(7) 14-Sep-78 13:06:00 WARREN
.REL.1;P775200 8 3705(36) 14-Sep-78 13:23:00 WARREN
PLCDDT.MIC.1;P775200 1 110(7) 26-Jun-78 13:18:00 WARREN
PLCLIB.CMD.1;P775200 1 305(7) 14-Sep-78 13:08:00 WARREN
PLCN.EXE.1;P775200 81 41472(36) 17-Aug-81 10:27:00 WARREN
.2;P775200 81 41472(36) 17-Aug-81 10:37:00 WARREN
.3;P775200 81 41472(36) 17-Aug-81 10:39:00 WARREN
PROLOG.DOC.1;P775200;P 58 146190(7) 12-Jul-81 20:37:07 PROLOG
.EXE.1;P775200;P 115 58880(36) 12-Jul-81 20:37:49 PROLOG
.HLP.1;P775200;P 1 670(7) 12-Jul-81 20:39:07 PROLOG
READ.ME.2;P775200;P 1 982(7) 12-Jul-81 20:45:45 PROLOG
TUTORI.LPT.1;P775200;P 8 18104(7) 12-Jul-81 20:45:20 PROLOG
.PL.1;P775200;P 3 5714(7) 12-Jul-81 20:45:36 PROLOG
UUOSYM.UNV.1;P775200 13 6329(36) 11-Jan-79 17:14:14 UNTULIS
Total of 705 pages in 31 files
@tt <prolog>read.me
The tape for DEC20 Prolog version 3 contains the following files:-
- An executable files, PROLOG.EXE, which contain the the Prolog system.
- A document, GUIDE3.MEM, which describes the new features of Prolog
version 3.
- A document, DEBUG.MEM, describing the new debugging facilities
available.
- The original Prolog manual, PROLOG.DOC.
These files where obtained from
David H. D. Warren
Department of Artificial Intelligence
University of Edinburgh
Hope Park square, meadow lane
Edinburgh EH8 9NW
Scotland
In addition, the tape contains the files:-
- A Prolog tutorial, TUTORI.LPT.
- A Prolog source file TUTORI.PL, containing code for the examples
in the tutorial.
- A help file, PROLOG.HLP
- This file, READ.ME.
These files where obtained from
Udi Shapiro
Department of Computer Science
Box 2158
Yale University
New Haven CT 06520
@pop
[PHOTO: Recording terminated Mon 31-Aug-81 9:10AM]
-------
∂31-Aug-81 0924 Stan at SRI-AI More on PROLOG
Date: 31 Aug 1981 0926-PDT
From: Stan at SRI-AI
Subject: More on PROLOG
To: admin.mrc at SU-SCORE
cc: jmc at SU-AI, stan
Sorry to bother you again, but I just had a looked at David Warren's
directory <WARREN> on SRI-AI, and I found the newer version John
was talking about (Version 3.3). I confirmed this by running it.
So, I direct your attention to <WARREN>PROLOG.EXE.
--Stan
-------
∂31-Aug-81 1011 FFL
To: JMC, FFL
In to prepare the expense reports for Colermauer and Stoyan I need to
have the bill from the Faculty Club to justify the per diem payments.
I called the Club which told me that they do not give out any billings
until the end of the month. When you get your statement, please give
it to me so that I may use it to justify the perdiem expenses.
∂31-Aug-81 1036 FFL CALL FROM SANDIA - JACK TISCHHAUSER
To: JMC, FFL
Mr. Tischhauser is the host for your visit at Sandia. He called to ask
your arrival plans, if you will need visual aids, would you allow the talk
taped, etc. He would like you to call him this afternoon. He will be in
his office at 505 844 1041.
∂31-Aug-81 1757 Peter Tancig <PETER at MIT-AI>
Date: 31 August 1981 20:54-EDT
From: Peter Tancig <PETER at MIT-AI>
To: jmc at SU-AI
Is it possible to get a copy of your book:
"LISP - Programming and Proving", 1977, SU ?
I have not been able to get one here in Boston.
Regards, Peter Tancig (PETER@MIT-AI)
∂01-Sep-81 0000 JMC*
Check out Than Le furniture in Town and Country.
∂01-Sep-81 0846 FFL Call from Dr. Wald on Aug. 3l
To: JMC, FFL
Asked that you phone him. Office; 856-9777. Home: 856-2473.
To: JMC, FFL
Said he had been recommended by Professor Albert Macovski and would like
to speak with you. His Palo Alto office number is 856-9777.
∂01-Sep-81 1049 pratt@Shasta via Ethernet
Date: 1 Sep 1981 10:48:48-PDT
From: pratt at Shasta
To: gabriel, mccarthy
Subject: equip
Ok, you're both on the equip mailing list. Send mail to it as
equip@shasta. (Sail, Score, and Sumex all seem to know about shasta
)
∂01-Sep-81 1059 RINDFLEISCH@SUMEX-AIM via Ethernet
Date: 1 Sep 1981 1050-PDT
From: Rindfleisch at SUMEX-AIM
Subject: LISP FUTURES
To: equip at SU-SHASTA
cc: RINDFLEISCH at SUMEX-AIM
Following is a collection of comments on the flurry of msgs last week
while some of us were gone:
1) Bob Engelmore's comment about the use of the term "Dolphin" in the
discussion at the last planning mtg is quite right. "Dolphin" was
intended as a place holder for the general notion of "personal LISP
machine" as we were sketching out the rough content of a "wish list"
plan. The recent SUMEX/HPP decision to buy 5 Dolphins was pragmatic
and based on an immediate need for LISP cycles, availability of
hardware, large existing investment in INTERLISP software, and
existing interface to PUP-based network servers. These issues need
careful reconsideration for a 3-5 year plan.
2) A more fundamental issue confronting us about future sources of LISP
cycles is personal versus shared machine environments. The
economics of machines seems to be pointing to arrays of personal
workstations. In the next couple of years, for somewhere on the
order of $40-80K, one can get a machine ~KL-10 speed that runs a
superb LISP with bit-mapped display, large address space, etc. One
can get at least ten of these for the price of a 2060. There are
counter arguments about not being able to aggregate this dispersed
capacity, requiring enough machines so that all LISP users can be
serviced in an unshared machine environment, and being able to
bypass the bit-mapped display for remote use. All of these issues
need to be thrashed out in the Stanford context to see if there is
any consensus and if so what the optimum strategy is.
3) Henry Baker of Symbolics is in the Stanford area this week. They
are installing their first machine at Fairchild and he will be
stopping by to talk about our long-term plans. Let me know who else
is interested in talking to him.
4) Dolphins do not just run LISP. They run a lot of the Alto code
including Bravo, FTP, Chat, etc. There are many who will still
prefer other machine environments but I wanted to be sure the
Dolphin is properly represented in this discussion. I am forwarding
a recent benchmark measurement of KL-ONE on a Dolphin and KL-10 for
what it is worth in a separate msg. The speed of the Dolphin when
running INTERLISP may increase by a factor to 2 and its price may
decrease by a factor of two in the next year. The real "bad guy"
in all of this could be Xerox itself (themselves?). They rival
the likes of IBM and DEC in being slow to respond to our relatively
small market. It's not clear what the future of a Star LISP machine
is.
5) The notion of "Common LISP" is super!!! If it really comes off and
provides a high-performance, uniform, documented, and maintained
LISP for the range of machines contemplated, I believe it will take
over the LISP world. I thoroughly support that effort. The only
catch for our planning is when a smoothly running system will be
running and available.
6) I talked to Rick Peebles from DEC at IJCAI last week and it looks
like DEC is about to agree to the ARPA PI proposal to subsidize
single-user VAX 11/750's at about $30K each. This would be through
Dick Eckhouse's university research group at DEC and is intended to
be an alternative to the single-user VAX which DEC cannot bring
themselves to release. It is probably underpowered anyway compared
to other choices on the market. DEC would make machines available
to ARPA-sponsored research efforts they approve. I'm not sure what
kind of computer science DEC will "approve" but at least AI efforts
are included.
7) For those who aren't aware of it, SUMEX funded Larry Masinter to
look into the Interlisp VAX development effort at USC-ISI. That
report is in the process of being published now and a
pre-publication draft is available on-line at SUMEX in
<MASINTER>INTERLISPVAX.TTY or .PRESS. The current estimates for
Interlisp VAX are not too rosy and VAX itself may be a LISP loser.
Still, DEC may be interested in adapting the microcode to support
LISP more efficiently so that could improve things. In any case,
a lot of the outside world is using VAX and that remains an
important vehicle for software dissemination -- at least for some
of us.
8) The quote John McCarthy got from Foonly for a 4 Gbyte file server
looks very interesting. We have been talking to Foonly about their
importing our PUP service code for Foonly TENEX so things should be
reasonably compatible and accessible for change/development. One
of the main issues is if that system has the throughput needed.
9) I think Dick Gabriel would be an excellent addition to the planning
group. We need to gather as much expertise as possible in
formulating a plan.
Tom R.
-------
∂01-Sep-81 1131 RINDFLEISCH@SUMEX-AIM via Ethernet
Date: 1 Sep 1981 1120-PDT
From: Rindfleisch at SUMEX-AIM
Subject: FYI RE DOLPHIN/KL-10 BENCHMARK
To: Interlisp-Dolphin-List:
Mail-from: ARPANET host PARC-MAXC rcvd at 24-Aug-81 1247-PDT
Date: 24 Aug 1981 12:47 PDT
Sender: BURTON at PARC-MAXC
to: feigenbaum@sumex-aim, rindfleisch@sumex-aim
subject: Dolphin Interlisp KL-ONE benchmark
from: The Interlisp-D group (Xerox Palo Alto Research Center)
reply-to: burton
We have often been asked to summarize the overall performance of Dolphin
Interlisp relative to other systems used for AI research. However, we have found
that comparisons based on isolated single measurements (of, for example, the
number of Lisp "instructions" per second or the times taken for function call or
examples such Ackerman's function, list traversal, etc. etc.) vary wildly,
depending on what aspects of the two performance profiles they tap. It is in
response to this variability that we have characterized the Dolphin's
performance, averaged across a wide variety of measurements, in terms of KA-10
equivalents, rather than in terms of individual benchmarks.
Nevertheless, continued concern as to the adequacy of Dolphin Interlisp for
serious AI research has persuaded us that some specific demonstration of its
performance would be useful. In light of the variability of small benchmarks,
we decided to measure a large, existing Interlisp AI system running on both a
Dolphin (provided by XEOS) and a DEC KL-10. In addition to measuring a
broader range of system behavior (including swapping and garbage collection),
we felt that such a benchmark would be more representative of the
computational loads encountered in AI research.
Bill Mark and Tom Lipkis of ISI were kind enough to help us by carrying out
timing comparisons of the part of their Consul system, written in KL-ONE,
which classifies concepts into a KL-ONE network. KL-ONE is a knowledge
representation formalism developed in Interlisp at BBN which is becoming
increasingly popular in the AI community. The same source code was compiled
and run unchanged in normal production versions of both systems. No special
optimizations were done, nor were any standard system facilities (such as
garbage collection) disabled in either system.
Timings were done under a variety of load conditions on the KL-10. The load
average (LA) during the test was monitored approximately once a minute. Times
given are elapsed time, as measured with a stopwatch to guard against
unreported overhead. All times are in seconds.
elapsed total cpu gabage collection cpu less GC
Dolphin 145 139 included in cpu -
KL-10 (LA .2 - .8) 84 64.5 25.5 39
KL-10 (LA .6 - 1.0) 116 75 31 45
KL-10 (LA 1.1 - 2.1) 265 84 47 47
KL-10 (LA 2.3 - 3.5) 415 90 42 48
KL-10 (LA 4.6 - 11.3) 905 86 38 48
The dramatic variation in elapsed time indicates how misleading measures of
system internal clocks can be as measures of delivered computing power. In
terms of what the user gets, these measures indicate that a Dolphin delivers, for
this benchmark, computing power roughly comparable to that delivered by a
KL-10 with a load average of ~1.5. Further, although these figures indicate that
Dolphin Interlisp already dominates Interlisp on a KL-10 under normal operating
conditions, we expect further significant performance improvement over the next
two months.
-------
∂01-Sep-81 1336 CSD.GOLUB at SU-SCORE Equipment Committee
Date: 1 Sep 1981 1336-PDT
From: CSD.GOLUB at SU-SCORE
Subject: Equipment Committee
To: jmc at SU-AI
cc: CSD.GOLUB at SU-SCORE
John!
It is OK with Jeff that you serve on the equipment committee.
The next meeting is on Friday at 10am in my office.
GENE
-------
∂01-Sep-81 1346 CSD.GOLUB at SU-SCORE Correction
Date: 1 Sep 1981 1347-PDT
From: CSD.GOLUB at SU-SCORE
Subject: Correction
To: jmc at SU-AI
The meeting is in MJH 220 on Friday.
Hope you can make it , GENE
-------
∂01-Sep-81 1448 RPG
∂01-Sep-81 1446 JMC
Are you here now?
Yes, in the basement readin equip.mem[e81,jmc]. I am back permanently
with the possible exception of a week or so in a week or so.
-rpg-
∂01-Sep-81 1449 CSD.GOLUB at SU-SCORE Classroom
Date: 1 Sep 1981 1449-PDT
From: CSD.GOLUB at SU-SCORE
Subject: Classroom
To: csd.bscott at SU-SCORE, csd.dbrown at SU-SCORE
cc: CSD.GOLUB at SU-SCORE, jmc at SU-AI
John McCarthy has suggested that it would be a good idea to have
a classroom and seminar room in MJH. In particular, he suggested
that MJ 402 be used as a classroom/seminar room ONCE THE LARGE
TABLES are removed.(It looks to me like they can be storedin MJH402A).
I think a better idea is to move the students from MJ352 to MJ402
and to use MJ352 as the seminar/classroom.MJ352 has 400ft and
MJ402 has 352ft so we may loose one student space. However MJ352
is a more convenient space for lecturing.
So, I would like this transition to be made before the new term begins.
I would prefer my plan but if it is not possible to execute we
could go along with McCarthy's idea.
GENE
-------
∂01-Sep-81 1514 RPG
∂01-Sep-81 1446 JMC
Please inspect EQUIP.MEM[E80,JMC] before I send it to EQUIP.
Looks pretty good. About the file server, we eventually need to
be able to access pages (or pieces of files) over the net with
possible slower migration in the background of the whole file.
I assume this is the research part of the file server that you
are referring to?
About terminals. I doubt that the SUN can be produced very cheaply
either, especially with pie-in-the-sky neurosis afflicting the
designers now and then. I don't think we could see 200 in less
than 3 years. I think it might be preferrable to have some
of the terminal money go to a vast number of cheap terminals
for the masses. This is what CMU has done and I think there is
a valid point to providing a reasonable terminal for everyone.
In conjunction with the data compression stuff they have (36kbaud
effective rate on a 9600 baud line) I think that fast, good editing
for all could be had.
About computers. I have yet to see a personal computer that could
be available within a reasonable amount of time for a reasonable
price that enticed me to want one. I've seen some benchmarks done,
but they have never been in terms of a function crunch per user*dollar
as a function of the number of users. I believe there simply has to be
a way for everyone to be editing at the same, which may not be possible
for the monetary constraints on the number of machines to buy.
Further, unless te file server really does page files nicely, I
don't think that an FTP-like protocol with personal machines can
support the style of work that many people have, especially group
projects.
About replacing SAIL. As a machine, yes it needs replacement, but I
don't want to regress from features and lessons we've learned from it.
The editing style and terminal interface is mandatory for its replacement.
I've spent 2 months at CMU using EMACS and TOPS-20, and Rod Brooks
and I estimated our effectiveness to be 30-40% of what it is on SAIL,
simply due to the terminal rate and the lack of a line editor.
-rpg-
∂01-Sep-81 1523 reid@Shasta via Ethernet
Date: 1 Sep 1981 15:21:21-PDT
From: reid at Shasta
To: equip
Subject: Dolphins
Dolphins are D-machines. This means that they implement the Mesa byte code.
They will not run any program that assumes the existence of an Alto
micro-machine. They have an Alto emulation mode, but Xerox has told other
universities that if they buy Dolphins, they will not be permitted to
have any of the Alto software for them; in effect, they get Interlisp
and nothing else. I guess since Stanford has physical posession of the
alto software, we can run it on our Dolphins, but not all of it will
run.
∂01-Sep-81 1540 RINDFLEISCH@SUMEX-AIM via Ethernet
Date: 1 Sep 1981 1538-PDT
From: Rindfleisch at SUMEX-AIM
Subject: Re: Dolphins
To: equip at SU-SHASTA
In response to your message sent 1 Sep 1981 15:22:18-PDT
The Dolphin does indeed run the Alto stuff in emulator mode. Basically
any of the programs that depend on modifying the Alto microcode will not
run as Brian points out. Chat, FTP, and Bravo do work. The state of
the "university" software package as far as availability to others is
not clear. Xerox EOS is still "working" the problem of releasing the
TENEX/TOPS-20 PUP service codes and I have heard that the other stuff
may be included. There is pressure from other Dolphin recipients for
release of the broader package.
This legal mumbo jumbo and inertia is one of the real hassles in dealing
with Xerox about research products...
Tom R.
-------
∂01-Sep-81 1540 RINDFLEISCH@SUMEX-AIM via Ethernet
Date: 1 Sep 1981 1538-PDT
From: Rindfleisch at SUMEX-AIM
Subject: Re: Dolphins
To: equip at SU-SHASTA
In response to your message sent 1 Sep 1981 15:22:18-PDT
The Dolphin does indeed run the Alto stuff in emulator mode. Basically
any of the programs that depend on modifying the Alto microcode will not
run as Brian points out. Chat, FTP, and Bravo do work. The state of
the "university" software package as far as availability to others is
not clear. Xerox EOS is still "working" the problem of releasing the
TENEX/TOPS-20 PUP service codes and I have heard that the other stuff
may be included. There is pressure from other Dolphin recipients for
release of the broader package.
This legal mumbo jumbo and inertia is one of the real hassles in dealing
with Xerox about research products...
Tom R.
-------
∂01-Sep-81 1549 ENGELMORE@SUMEX-AIM via Ethernet
Date: 1 Sep 1981 1546-PDT
From: Engelmore at SUMEX-AIM
Subject: Re: Dolphins
To: reid at SU-SHASTA
cc: equip at SU-SHASTA
Brian, I fail to see the point of your message. First of all, WE, i.e.
Stanford, have the software, and can run it on Dolphins if we wish.
Secondly, even if we couldn't run bravo, smalltalk or whatever, the
Dolphin satifies our need for Interlisp cycles, which the HPP desperately
needs. So, let's not discount it. I'd like to see about five Dolphins
purchased for HPP during the first year of the equipment contract, five
Lisp machines (probably the Symbolics 3600 if it materializes), and
five "other" in the "Dolphin" class.
Bob
-------
∂01-Sep-81 1812 RWW
From: Richard Weyhrauch
12625 La Cresta Drive
Los Altos Hills, CA 94022
415-948-2149
In the interest of scientific inquiry and international scientific
cooperation I have invited all known non-local survivors of IJCAI who
are in the area to meet at my house on Wednesday, September 2, 1981
starting at 7:00pm to gossip and drink before moving on. Everyone
is welcome. Please bring friends. There is a textual map giving
directions to my house in MAP[S,RWW]@SU-AI. Sorry for the late
announcement but I just arrived back myself. Net mail RSVP would
be nice but is not necessary. I hope to see you there.
∂01-Sep-81 2157 Peter.Andrews at CMU-10A Your axioms for the S and P problem
Date: 2 September 1981 0057-EDT (Wednesday)
From: Peter.Andrews at CMU-10A
To: JMC at SU-AI
Subject: Your axioms for the S and P problem
CC: Peter.Andrews at CMU-10A
Message-Id: <02Sep81 005706 PA01@CMU-10A>
I'd be interested to see these if it's easy to send them. If they're
in a SCRIBE file, I can run our SCRIBE on it here, of course.
Peter Andrews
∂02-Sep-81 0414 Alan Bundy <BUNDY at MIT-AI>
Date: 2 September 1981 07:02-EDT
From: Alan Bundy <BUNDY at MIT-AI>
To: jmc at SU-AI
John
This is just to establish contact and to remind
you that you promised to send me (a) your Mr S & P axioms
(b) details on DIALNET. If either are long could you send them
by steam mail as I have trouble with long messages on this link?
I enjoyed our conversations in LA/Vancouver.
Alan
∂02-Sep-81 0643 Mark Crispin <Admin.MRC at SU-SCORE> Re: Re prolog
Date: 2 Sep 1981 0624-PDT
From: Mark Crispin <Admin.MRC at SU-SCORE>
Postal-Address: 12155 Edgecliff Place; Los Altos Hills, CA 94022
Stanford-Phone: (415) 497-1407
Subject: Re: Re prolog
To: Stan at SRI-AI, jmc at SU-AI
In-Reply-To: Your message of 31-Aug-81 0904-PDT
Unfortunately, I do not have an account at SRI-AI. Do you think you
can have somebody in the know write up a tape with all the appropriate
files for PROLOG so that I can put it up at SCORE for JMC? I do not
know anything about the system so have no way of knowing what is an
appropriate file for it and what isn't.
-- Mark --
-------
∂02-Sep-81 0734 pratt@Shasta via Ethernet
Date: 2 Sep 1981 07:15:24-PDT
From: pratt at Shasta
To: equip
Subject: loose ends
Let me tidy up some minor loose ends.
The $6M figure is a needs-driven number. Initially we tried fitting
into a $2M limit, but then temporarily discarded
this constraint in order to get a less biased assessment of
perceived needs. The bottom line of an actual proposal to
any agency will of course be more realistic.
Andy Bechtolsheim tells me my note of caution on Sun pricing was overly
conservative. He has figured the 100 qty. parts cost of a workstation to
be $2500 even at today's prices. Treat that as ballpark, I want to go over
his estimates before swearing by them. However it does seem more plausible
to me now that Stanford could acquire 200 workstations for $1M. The $6,800
Cadlink price for 30 workstations seems less of a bargain in that light.
Whoever said that the Alto would be $500 in 5 years time must have been
referring to just the display monitor. Wild guesstimates should be
captured in writing for them to be quotable at maturity.
I value kibitzer input for this committee. Being good at generating
ARPA proposals needn't imply that one is also good at assessing
needs unaided.
∂02-Sep-81 0815 Betty Scott <CSD.BSCOTT at SU-SCORE> Re: Classroom
Date: 2 Sep 1981 0811-PDT
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: Re: Classroom
To: CSD.GOLUB at SU-SCORE, csd.dbrown at SU-SCORE
cc: jmc at SU-AI, CSD.BSCOTT at SU-SCORE
In-Reply-To: Your message of 1-Sep-81 1449-PDT
I defer this decision to you. It would be much easier to convert 402, since
the alternative would require the moving of many desks and bookcases, files,
etc. The two large tables could be placed near the stairway in the foyer
on the lower level (if they are not needed elsewhere). I had wanted a table
or two on the lower level for miscellaneous work space, but the Boys Town
people didn't think much of this idea, since they considered part of that
space theirs.
Whatever you decide is o.k. with me. I suggest that you and Denny might
want to discuss this when he returns next week. I will be on vacation, so
the order to the Work Control Center can be given directly to Susan.
Betty
-------
∂02-Sep-81 1156 DRF regards from Larry Pfeffer
I spoke by phone with Larry Pfeffer (he's interested in TEX), and
he asked that I send you his regards.
-David Fuchs
∂03-Sep-81 0022 Jerry E. Pournelle <POURNE at MIT-MC>
Date: 3 September 1981 03:21-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
To: JMC at SU-AI
McGrath is who I meant. Something got fouled in transmissin,
because JPM is what I thought I sent. You need not ask him,
since you've really answered my question; I gather that he'll be
back shortly?
Thanks,
Jerry
∂03-Sep-81 1002 CSD.GOLUB at SU-SCORE Binford's Salary
Date: 3 Sep 1981 1000-PDT
From: CSD.GOLUB at SU-SCORE
Subject: Binford's Salary
To: jmc at SU-AI
cc: CSD.GOLUB at SU-SCORE
We ned your letter on Binford ASAP. GENE
-------
∂04-Sep-81 0319 Mark Crispin <Admin.MRC at SU-SCORE> more on extended Lisp
Date: 4 Sep 1981 0318-PDT
From: Mark Crispin <Admin.MRC at SU-SCORE>
Postal-Address: 12155 Edgecliff Place; Los Altos Hills, CA 94022
Stanford-Phone: (415) 497-1407
Subject: more on extended Lisp
To: JMC at SU-AI, RPG at SU-AI
SYS:PLNR.EXE on SCORE is an extended addressing Micro-Planner.
-------
∂04-Sep-81 1100 JMC*
Garland about Goad. Notebook.
∂04-Sep-81 1201 TOB
To: csd.golub at SU-SCORE, JMC at SU-AI
Gene
I would like to invite Dr. Raja Chatila, Toulouse, as a visitor.
His salary will be paid by a French grant. He would work on our
mobile robot project. From what I have seen and from his recommendation,
he seems good.
The issue is space and departmental approval I would like to have him.
Is there a way that we could get a desk for him for a year, starting November?
Tom
∂04-Sep-81 1301 Gene Golub <CSD.GOLUB at SU-SCORE>
Date: 4 Sep 1981 1259-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
To: TOB at SU-AI, JMC at SU-AI
cc: CSD.GOLUB at SU-SCORE
In-Reply-To: Your message of 4-Sep-81 1201-PDT
Space is really going to be at a premium this next year. Do you have
any ideas where he might be housed? Has anyone spoken for Zohar's
office? Perhaps you should speak to Denny Brown when he returns next week.
GENE
-------
∂04-Sep-81 1423 ullman@Shasta via Ethernet
Date: 4 Sep 1981 14:20:05-PDT
From: ullman at Shasta
To: equip
Subject: meeting
The next meeting of the committee is at 9:30am in B220, Friday Sept. 11.
I hope that before then, each of you will create and mail to equip a list
of the items that you believe we should purchase over the next 3 years.
There is no limit on the expense, but neither is there a point in suggesting
things the community cannot possibly use.
∂04-Sep-81 1640 ullman@Shasta via Ethernet
Date: 4 Sep 1981 16:36:13-PDT
From: ullman at Shasta
To: equip
Here is my guess as to the consensus regarding equipment. I
have included in the list certain items that are partially
development cost, i.e., salaries or prototype equipment,
rather than equipment per se. I have also added to the list
the two vaxen for which we have received partial payment
from NSF, and for which we must raise the balance. I have
not included the Binford vax, since it is totally outside
our responsibility, nor have I included other items, e.g.,
the Dolphins already on order, for the same reason.
ITEM 1982 1983 1984 TOTAL
1. S1 $500 $500
2. Dolphins (10) 600 600
3. Symbolics (5) 375 375
4. Foonly 225 225
5. SUN (200+development) 750 250 250 1250
6. Med.-cap. terminals (100) 150 100 250
Including development
7. Low-cap. terminals (100) 50 50 100
8. Ethernet equipment 55 55 110
9. Star printers 90 60 60 210
10. NA Vax 260 260
11. Vax 11/750 120 120
12. Purchase of Diablo 200 200
13. Local ethernet and local 150 150 300
file store purchase
and development
TOTAL $2,755 $1,285 $460 $4,400
Grants already in hand:
Stouffers $150 $150
NSF 100 50 150
TOTAL $250 $50 $300
NET to be raised $2,505 $1,235 $460 $4,100
Notes: I assume that the Symbolics machines would be used by
the AI lab until such time as we could obtain an S1 or
equivalent, at which time they would be turned over to HPP
in lieu of the 5 Dolphins we had previously budgeted for
1983. Many of my price-tags are rank guesses, especially
where development costs are concerned. Please correct my
estimates.
September 4, 1981
∂04-Sep-81 1728 CG garland
Garland's address is:
Garland Publishing, Inc.
136 Madison Ave., 2nd Floor
New York, NY 10016
tel: 212-686-7492
Thanks for writing them.
Chris
∂04-Sep-81 1745 reid@Shasta via Ethernet
Date: 4 Sep 1981 17:42:25-PDT
From: reid at Shasta
To: equip
Subject: equipment for teaching
One of the things that this department needs, as far as I am concerned, is
a midsized computer that can be used for the advanced systems courses.
CS246 used Diablo last quarter; this was a big success. I know that Arpa
money is not used to purchase this kind of equipment, but I thought I'd
mention that in our (CSL's) mind there is a major need for this kind
of thing.
∂04-Sep-81 1745 reid@Shasta via Ethernet
Date: 4 Sep 1981 17:37:18-PDT
From: reid at Shasta
To: equip
Subject: Diablo
I'm curious about the "purchase Diablo" bit.
Practically in the same breath, Ed said that he thought Vaxen
were overrated, and that he wanted to buy out Diablo. Did I
misunderstand something?
Brian
∂04-Sep-81 2032 DUFFEY at MIT-AI (Roger D. Duffey, II) HUMAN-NETS Digest V4 #42
Date: 4 SEP 1981 2157-EDT
From: DUFFEY at MIT-AI (Roger D. Duffey, II)
Subject: HUMAN-NETS Digest V4 #42
To: HUMAN-NETS at MIT-AI
HUMAN-NETS Digest Friday, 4 Sep 1981 Volume 4 : Issue 42
Today's Topics:
Query - Enable/34, Voice Synthesis - VOTRAX chip missing feature,
Comput`αs and People - Unix user-interface, Teaching Reading,
Humor - Love? Hacker Style
----------------------------------------------------------------------
Date: 3 Sep 1981 0615-PDT
From: Drcpm-Sc at OFFICE-7
Subject: 4Mbyte Memory Enhancement for PDP-11/34's
I recently read an article concerning an enhancement feature
to expand the main memory of the PDP-11/34 to 4 Mbytes. It
is supposedly marketed by Able Computer Inc of Irvine Ca.
Name: Enable/34
Cost: $6K
Implementation: RSTS/E autopatch procedure
supported by vender
Contains: Enable Control
Bus isolator: a modified dual-width board
Unbundled software
Optional cache
The enhancement is supposed to be reserved for customers with
11/34s operating under RSTS/E V7.0 who have the capability of
sysgen & installation of software patches.
Does anyone out there have any additional information that
you could pass along about this enhancement? Please respond
directly to:
[Rufus]:DRCPM-SC at Office-7
Rufus Morse-Ellington
U S Army Satellite
Communications Agency
------------------------------
Date: 2 September 1981 07:38-EDT
From: Landon M. Dyer <ZEMON at MIT-AI>
Subject: Votrax chip misfeature
Sure enough, on the Type-N-Talk unit you can vary the pitch
of the voice, but /only/ by changing the speed of the output as
well.
It turns out that you can't get slow understandable
speech, and you can't get fast understandable speech, but there
is a sort of middle range in which it is possible to get under-
standable speech with a little variation in speed. Think of a
voice recorded on a tape, then slow the tape down or speed it
up -- the sc/01 is about like that; there is an acceptable
middle range.
-Landon-
------------------------------
Date: 1 Sep 1981 20:11:47-PDT
From: decvax!duke!unc!smb at Berkeley
Reply-to: "decvax!duke!unc!smb in care of" <CSVAX.upstill at Berkeley>
In-real-life: Steven M. Bellovin
Location: University of North Carolina at Chapel Hill
Subject: Votrax SC-01 speech synthesizer
Steve Ciarcia's column in the September issue of BYTE magazine
gives a circuit (and a parts source) for the SC-01 synthesizer.
According to this article, there are two additional pitch-control
lines which are referred to as "manual inflection" controls. They
are used for "gross variations in pitch so that the chip can speak
with more than one voice". Ciarcia says that in general, these
are not needed, and can be ignored. I have never used any speech
synthesizers, so I have no idea whether or not this satisfies
Lauren's objections.
------------------------------
Date: 2 Sep 1981 1246-PDT (Wednesday)
From: Lauren at UCLA-SECURITY (Lauren Weinstein)
Subject: SC-01
I don't know what Steve at BYTE is talking about, but MY data
sheet for the SC-01 doesn't show any "gross pitch change"
controls.
There are 6 bits for phoneme, and 2 bits for inflection, just
like with the Votrax VS-6. There is no way to alter the basic
pitch other than to change the master clock, which also affects
phoneme timing.
In fact, when I dug out the old data sheet, I noticed something
I had not seen before -- there actually IS a note about the
problem:
------------------------------
NOTE
Varying clock frequency varies voice and sound effects. As clock
frequency decreases, audio frequency decreases and phoneme timing
lengthens.
------------------------------
My fault -- I missed it somehow. In any case, if Steve
thinks that inflection control is not really necessary, then
he is probably falling prey to one of the classic problems with
synthesizers. It's sorta like this: If you KNOW approximately
(or exactly) what the synthesizer is going to say, it sounds a
WHOLE LOT better than it does if you DON'T know what to expect.
One of the classic methods for testing a synthesizer is to type
words at a text-to-speech algorithm and see how it sounds. It
usually sounds pretty good. But turn your back on the terminal
and let someone else type things without telling you in advance
what they'll be -- you'll usually start to have real problems,
and it is in this more useful case that timing, inflection, etc.
are critical. (I learned all this the hard way by listening to
a VS-6 that was reading random wire service copy.)
--Lauren--
------------------------------
Date: 2 Sep 1981 16:44:35-PDT
From: decvax!pur-ee!purdue!cak at Berkeley (Chris Kent)
Reply-to: "decvax!pur-ee!purdue!cak via" <CSVAX.upstill at Berkeley>
Subject: unix
In-reply-to: Daniel Weinreb
You mention that the anti-unix article described V6, that V7
only runs on split I/D machines, and that the latest Berkeley
release runs on VAXen. Also, you state that the PDP-11 is dead
as a usable machine (or words to that effect). I must heartily
disagree. There are many Universities or small firms that can't
afford anything more than an11, and for those people, it serves a
wonderful purpose. As it turns out, the latest release relating
to UNIX from Berkeley is 2.8bsd, which contains much of their
VAX software retrofitted to PDP-11s, including a kernel that
will run an enhanced V7 on any PDP 11 with memory management
(this is meant to be a qualification that excludes LSI-11s; it
runs on the 11/23,24/34/35/40/60, as well as 44,45,50,55, 70).
At the University of Cincinnati, the budgets are small, and we
could only acquire computing hardware incrementally. So we have
a number of small, 4-6 user systems running UNIX, because it is
better than anything that DEC offers for that class of processor.
To wit, RSTS/E leaves you with only BASIC, and RSX is a real time
executive (which it does passably) NOT a time-sharing system (which
it does horridly!). For the VAX, VMS people are willing to admit
there are problems because it started out as a rehack of RSX/IAS
(which are horribly intertwingled). In VMS 1.0, many of the
utilities were PDP 11 binaries that ran in compatibility mode!
I am, possibly, one of those raving UNIX fanatics that was
described recently in Human-nets, among other places. I am
admittedly an expert. I have found a great deal of success in
dealing with researchers that just want to push the button and
have it go, by doing some work before putting them on the system!
This means having an introductory lecture or document, holding
their hand for a few days, and setting up the default environment
for them, to be friendly, until they get around to figuring it
out for themselves. Most of the people I have interacted with
have enough intellectual curiosity that they want to know how
they can invoke the underlying power. UNIX wins in that you can
do almost anything, exactly the way you want to. You can tailor
it to your environment. Other systems lose because they can't be
tailored. You are locked (hard-wired) into a command interpreter,
for example. It's just that with UNIX, if your user community is
not a bunch of computer scientists, you -- the support group --
have to work a little bit to set up a friendly environment first.
At least the ability to do so is there.
This has been burning in me for a while; it feels good to get it
out.
Chris
(pur-ee!purdue!cak)
------------------------------
Date: Thursday, 3 September 1981 19:00-EDT
From: Jan Walker <JWALKER at BBNA>
Subject: terminology for users
naive, adj. [Fr naive, fem of naif, OFr inborn, natural ...]
1: marked by unaffected simplicity : ARTLESS, INGENUOUS
2: showing lack of informed judgment; esp : CREDULOUS.
Webster's Seventh
The word naive is an unpleasant word to have applied to oneself.
Might I strongly recommend a substitute (almost any substitute,
except dummy user) like "novice," "untrained," "unsophisticated,"
or "inexperienced." These lack the derogatory connotations of
"naive" and contain more information about the particular user
characteristics under discussion. Nothing makes a programmer
sound more arrogant than dismissal of those not at the same
level of understanding or need as "naive."
------------------------------
Date: 3-Sep-81 13:31:09 PDT (Thursday)
From: Hamilton.ES at PARC-MAXC
Subject: Re: Yet more Johnny (longish)
To: AGRE at MIT-AI, SSteinberg.SoftArts@MIT-MULTICS
ETS has a rigorous system of injecting a certain numbers of
questions from SAT's of years past back into the current tests,
to permit comparisons between years with a high degree of
accuracy.
I recommend the article "Achievement Test Scores in Mathematics
and Science" by Lyle V. Jones in SCIENCE v.213 #4506, 24 July 1981,
pp.412-416.
Abstract: "Average achievement test scores of the nation's youth
in mathematics and science have declined rather steadily since the
early 1960's, and this decline is more marked in the higher grades.
The average test scores in mathematics and science of high school
seniors who have intended to go to college and major in those
fields, however, have been quite stable."
This seems to indicate that the "two cultures" phenomenon
(humanities vs. math and science) discussed by C. P. Snow something
like 30 years ago is getting worse, not better, in spite of the fact
that technology-type skills are becoming more and more important in
defining one's ability to function in our society.
--Bruce
------------------------------
Date: 3 Sep 1981 12:33:26-EDT
From: cjh at CCA-UNIX (Chip Hitchcock)
Subject: Re: "Re: all these 'Why Johnny Can't Read' flames"
Cc: ryland at sri-kl
Are you serious?!? Even if simple literacy does foster that
illusion (which I doubt) isn't illiteracy even worse, fostering the
illusion that whatever someone \\chooses// \\to// \\tell// \\you//
is truthful and comprehensible. Universal literacy may be bad, but
the alternatives are far worse---even such an elitist as Heinlein
recognized this before he descended into books in which a large
part of the society has never been taught to read. Literacy at
least gives you the chance to find alternate opinions; teaching
the infallibility of print is certainly not a requirement for
reading courses.
------------------------------
Date: 3 Sep 1981 1630-PDT (Thursday)
From: Lauren at UCLA-SECURITY (Lauren Weinstein)
Subject: literacy
I agree. Why bother forcing everyone to read? Freedom of
choice, right? Of course, these same people won't be able to
drive (can't read the street signs) or use public transportation
(can't read the maps), or write checks, or fill out forms, and
all that sort of stuff, but who cares? We could better spend
our tax money and build institutions for all these people,
right?
C'mon. We aren't talking about forcing everyone to become a
scholar in English Literature. Current tests indicate that
an amazingly high percentage of high school graduates do
not have the simple reading and writing skills to fill out
an employment form or read a map. This is a technological
society, and a minimum literacy is an absolute necessity to
live in it successfully -- unless we plan to take all these
people and gas them, or dump them on an island somewhere.
--Lauren--
------------------------------
Date: 3 Sep 1981 0410-EDT
From: Hobbit <AWalker at RUTGERS>
Subject: From Newsweek, 31-Aug
Had we but world enough, and time,
This coyness, Lady, were no crime.
At times like this, there is no need
To dally, for with digital speed
Your passion can be quantified
By yon computer at our side.
Syntonic Corp. of Houston, Tex.,
Has made a program just for sex.
Called Interlude, it may seem bold;
Still, they claim 15,000 sold.
An answer to lust's young hollers
The program costs twenty dollars.
Fit for the home-computer rack
Made by Apple and Radio Shack,
It questions you like Socrates,
Then calculates what should best please.
Some queries may seem like child's play:
"What is your mood?" But others say:
"If you'd be a film, would you pick
Woody Allen or a porno flick?"
We type our answers (it hears no voice)
And then we read our master's choice.
Its data banks contain above
Nine dozen pleasant scenes of love--
Amid the amorous bits and bytes,
Concoctions for all appetites.
Some are tender, some shock the lips,
But none require chains or whips.
And worry not your virgin heart,
This Interlude can take your part:
Should my passion make you cower
It will prescribe an icy show'r.
Now therefore, while the youthful hue
Sits on thy skin like morning dew,
And while thy willing soul transpires
At every pore with instant fires,
Let from your lips your love escape
In secret to computer tape.
And we can sport us while we may
In this new electronic way.
No more to worry that I hear
Time's winged chariot hurrying near,
We now can win love's tender race
By means of sexual interface.
-- ALLAN J. MAYER with
ANDREW MARVELL in Despair
------------------------------
End of HUMAN-NETS Digest
************************
∂05-Sep-81 0944 RDD at MIT-AI (Roger D. Duffey, II) Your HUMAN-NETS-REQUEST : Removal
Date: 5 SEP 1981 1241-EDT
From: RDD at MIT-AI (Roger D. Duffey, II)
Subject: Your HUMAN-NETS-REQUEST : Removal
To: JMC at SU-AI
CC: DUFFEY at MIT-AI, HUMAN-NETS-REQUEST at MIT-AI
CC: Admin.MDP at SU-SCORE
You have now been removed from HUMAN-NETS at your request.
We will do what we can to keep you informed about changes
in HUMAN-NETS that might be of interest to you, or other
lists in this area with lower distribution volumes.
Cheers,
Roger
∂05-Sep-81 1528 ullman@Shasta via Ethernet
Date: 5 Sep 1981 15:15:28-PDT
From: ullman at Shasta
To: equip, reid
Subject: Diablo
Right now, arpa owns diablo.
Ed feels he cannot use it, so rather than send it back, or relinquish
his claims to it and let the network graphics end try to justify the whole
machine, I thought we might ask for diablo, at a suitably discounted price,
for general departmental use (which could include NG, of course).
One way would be to include it as part of the 2 million request; another
is to buy it with part NSF, part department funds.
Do you think this is reasonable?
∂05-Sep-81 1528 ullman@Shasta via Ethernet
Date: 5 Sep 1981 15:20:23-PDT
From: ullman at Shasta
To: equip, reid
Subject: equipment for teaching
I sympathize completely; of course we should be using things like vaxen in
instruction. I also feel that it is a bad precedent to use research machines
to serve the university's obligation to instruct its students.
If push comes to shove, I have to come down in favor of using the machines
for instruction, but perhaps there should be some attempt to get the
university to funnel some tuition-derived money into computers used
for instruction in our courses. Actually, they have done this for SAIL
and the ALTO's in limited cases, and only for non-CS students, but we need
to push on this point.
∂05-Sep-81 2211 Marvin Minsky <MINSKY at MIT-AI>
Date: 6 September 1981 01:05-EDT
From: Marvin Minsky <MINSKY at MIT-AI>
To: jmc at SU-AI
Sorry, no notebook seen.
∂06-Sep-81 0927 reid@Shasta via Ethernet
Date: 6 Sep 1981 08:41:17-PDT
From: reid at Shasta
To: equip, ullman
Subject: Diablo
Diablo is a good machine and should be used.
I guess the source of my confusion is the blurriness between department
resources and HPP resources. On the one hand this committee is meeting
to discuss buying department computer resources; one possible source
of department resources is to buy Diablo from Arpa/HPP. But on the other
hand, about a quarter the money in the currently proposed department budget
is allocated to machines that will be of little use to anybody except
HPP, and will amount to HPP resources. So I guess I don't quite understand
the boundaries of ownership and allocation.
∂06-Sep-81 1816 ME NS and option.txt
∂05-Jan-81 1847 JMC NS: @ should use option.txt on login area.
ME - OK. Now it does!
∂07-Sep-81 0000 JMC*
Florman letter
∂07-Sep-81 1124 Gene Golub <CSD.GOLUB at SU-SCORE> Letter Letter
Date: 7 Sep 1981 1121-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Letter
To: jmc at SU-AI
JOhn! I do have the binford letter! Thanks , GENe
-------
∂07-Sep-81 1142 CLT
Could you please hook up the TV sometime before 8pm? There is a program
I would like to watch tonight. (Tannhauser on KQED 8pm)
Thanks,
∂07-Sep-81 2233 Jerry E. Pournelle <POURNE at MIT-MC> McGrath
Date: 8 September 1981 01:33-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: McGrath
To: JMC at SU-AI
AAARRRRRRGGGGHHHH I was at Denver Hilton abut missed meeting
him. Ah, well. Didn't catch my mail before I left town...
∂08-Sep-81 0830 FFL EXPENSE REPORTS FOR COLMERAUER AND STOYAN
To: JMC, FFL
If you have received your Faculty Club bill for August, please bring it
with you to the office. You will recall that I need it in order to
take care of the expenses of these two visitors.
∂08-Sep-81 1259 Bobrow at PARC-MAXC Re:
Date: 8 Sep 1981 12:59 PDT
From: Bobrow at PARC-MAXC
Subject: Re:
In-reply-to: Your message of 07 Sep 1981 1157-PDT
To: John McCarthy <JMC at SU-AI>
cc: bobrow
What is Colmerauer's address? I have to write and ask him to join the board, so I
can ask him if he wants to do it (and that you recommended him). You can put
pressure on him too if you think that would help.
Do you think he would be better than Ray Reiter?
danny
Colmerauer is very talented but somewhat self-isolating and given to feeling
unappreciated. He is the originator of Prolog (1971), the first and main logic
programming language, but he didn't write a paper on it at the time, and
so his role is often ignored, because he isn't referred to in bibliographies
as the originator. It is as though I had neglected to write a paper on
LISP, and its effects are similar to the those of the fact that I didn't
write a paper proposing time-sharing in 1959, and my evidence for being
the inventor of it is my January 1959 memo to the director of the M.I.T.
Computation Center. Anyway, there may be a little lost motion in Colmerauer
getting started, but I think he'll do as good a job as Reiter in the end.
There is no great rush, and it will bring Colmerauer out into more contact
with the AI public, which will be good for him and for the AI public.
The following address will get him, but I think it isn't up-to-date in
terms of French zip codes.
Prof. Alain Colmerauer
Groupe d'Intelligence Artificielle
Unite d'Enseignement et de Recherche
70, Route Leon-Lachamp
13 - Marseille (9 e)
FRANCE
∂08-Sep-81 1308 FFL Ticket to New Mexico
To: JMC, FFL
I assume that the agency mailed the ticket to your home address. If not,
let me know, please.
∂09-Sep-81 0806 Edward Fredkin <EF at MIT-AI>
Date: 9 September 1981 10:56-EDT
From: Edward Fredkin <EF at MIT-AI>
To: JMC at MIT-AI
Hi, two things, I need an instant copy of "The
Doctor's Dilemma" (along with X-teen exercises in pessimism and paranoia)
sent to my directory at MIT-AI, also, I would like to chat with you
sometime very soon about Walsh's project at III. Please call me at
617-253-5904 (or at home, 617-277-4444) as soon as convenient.
Thanks, and best regards, Ed Fredkin.
∂09-Sep-81 0839 FFL CALL FROM ENDRES in Germanyy
To: JMC, FFL
He received the papers which were mailed. Said you were to speak at the U.
of Stuttgart on Tuesday, Sept. 29, at 4 p.m. People from Stuttgart will see
you at the conference and arranged for you to get to Stuttgart. You may then
leave Stuttgart on Wednesday morning.
Is there an abstract for your talk at Stuttgart? Need it by this Monday
morning. Suggested that you could cable it to him via the IBM office here.
If you do not have one, they will try to put one together.
If you have questions of him, his phone is 7031 163465 or his private number,
7031 805833.
∂09-Sep-81 0900 ENGELMORE@SUMEX-AIM (SuNet) Ownership and Allocation
Date: 9 Sep 1981 0842-PDT
From: Engelmore at SUMEX-AIM
Subject: Ownership and Allocation
To: equip at SU-SHASTA
I wish to put in my two cents about the "ownership/allocation" issue
that Brian Reid raised in his 6 Sept. message. ARPA's interest and
responsibility in the current context is to provide its contractors
with computer resources that will permit them to do the best possible
research in the most productive environment. ARPA views the research
it sponsors in the CSD pretty much along contract lines -- the HPP
contract, the Formal Reasoning work, the work at CSL, etc. Consequently,
Kahn and Adams will want to know how the proposed equipment helps those
projects. Moreover, the benefit should be at least approximately
proportional to the size of each effort.
HPP is a relatively large contract and could probably justify a $1.0 to 1.2
million refurbishing on its own. If HPP were to propose this to ARPA
independently of the rest of the department's needs, we'd probably get
most of what we wanted (and Brian wouldn't be confused about the allocation
of the equipment). Naturally, we in the HPP would like to see a proposal
from CSD/CSL that benefits us as much as if we were to write our own
proposal. In the interest of cooperation, and in the recognition that
some of the equipment on the wish list will benefit all of us (e.g. file
servers) in the department, the equipment earmarked specifically for HPP
is below the $1M figure (the Dolphins and most of the Lisp machines).
But it should be clear that the personal machines requested for HPP research
are, indeed, for the use of HPP staff and the consoles will be placed in
the project area.
-------
∂09-Sep-81 0928 ullman@Shasta (SuNet) Englemore reply to Reid
Date: 9 Sep 1981 09:26:29-PDT
From: ullman at Shasta
To: equip
Subject: Englemore reply to Reid
I am a little disturbed that the issue of how much each group gets of
the pie has reared its head. I assume that Bob knows of what he speaks
if he says that ARPA sees the refurbishment as a supplement to existing
contracts. I also agree that as a practical matter we should tie the
request as closely as possible to ARPA contract support.
However, I feel that we should be concerned too about how to strengthen
all areas of the department. For example, I doubt very much that when
NSF considers equipment proposals, it thinks about whether the research
it fosters will be sponsored by NSF. I also believe that the health of
each group depends not so much on the number of machines it owns, but
on the reputation of the entire department. That, in turn, depends on
our ability to hire bright young faculty members, attract the best students,
and so on. THAT depends on having the right equipment available to
people in all areas.
I hope, therefore, that the entire committee will think about the needs
of the entire department, and that we can save talk of exactly what
belongs to each group until we are ready to put the final proposal together.
∂09-Sep-81 1352 Mark Roberts <ADMIN.MDR at SU-SCORE> Prolog tape for McCarthy
Date: 9 Sep 1981 1352-PDT
From: Mark Roberts <ADMIN.MDR at SU-SCORE>
Subject: Prolog tape for McCarthy
To: admin.mrc at SU-SCORE
cc: stan at SRI-AI, jmc at SU-AI
Mark, Stan Rosenschein came by to drop off a tape for McCarthy.
He said you would know what it was about. The tape is on your
desk.
-------
∂09-Sep-81 1513 FFL CALL FROM ED FREDKIN
To: JMC, FFL
Asked when you would be back and where you could be reached. Said then
to tell you that he had called.
∂09-Sep-81 1541 FFL CONTEXT ADVISORY COUNCIL MEETING
To: JMC, FFL
Planned for Oct. 2, 9-11 a.m. Secretary to call back giving location.
Is on your calendar.
∂09-Sep-81 1610 FFL
To: JMC, FFL
Please call Gardner Lindzey at 321 2052.
∂09-Sep-81 2322 Richard M. Stallman <RMS at MIT-AI>
Date: 10 September 1981 02:21-EDT
From: Richard M. Stallman <RMS at MIT-AI>
To: jmc at SU-AI
Would you please post this notice at SAIL and SCORE for me?
Before Friday afternoon (Washington time), call Western
Union and ask to send a public opinion telegram to Edward P.
Boland, Congressman from Massachusetts, telling him "Support
$4million funding for the Solar Electric Propulsion System",
or some paraphrase.
SEPS is required for the mission to intercept Halley's
comet, and it was cancelled this spring. If we don't do it
now, the next chance is in 2061.
The public opinion telegram costs about two dollars.
You can send one even in the middle of the night, and
charge it to your home phone.
Don't mention that you are an engineer, or that you work
with computers, or that you went to college, or any
organization you are affiliated with. Politicians are
looking for the opinions of the "average man", and discount
anyone who they know is educated.
Please pass this on.
∂09-Sep-81 2359 Richard M. Stallman <RMS at MIT-AI>
Date: 10 September 1981 02:55-EDT
From: Richard M. Stallman <RMS at MIT-AI>
To: jmc at SU-AI
Have you read my paper RMS;META >?
Do you want me to come out for a month?
I'm thinking of mid-October thru mid to late November.
∂10-Sep-81 0053 Richard M. Stallman <RMS at MIT-AI>
Date: 10 September 1981 03:50-EDT
From: Richard M. Stallman <RMS at MIT-AI>
To: jmc at SU-AI
Oops. SEPS was going to be used for the Halley rendezvous mission,
not for the intercept. The rendezvous is probably too late in any case by now.
∂10-Sep-81 0131 Alan Bundy <BUNDY at MIT-AI>
Date: 10 September 1981 04:29-EDT
From: Alan Bundy <BUNDY at MIT-AI>
To: jmc at SU-AI
John
You were going to send me some stuff on DIALNET
and Mr S&P. What you actually sent me was stuff on the history
of timesharing. Vey interesting, but ....
Alan
Then I must have sent Stoyan the stuff on Dialnet. It will
be fixed.
∂10-Sep-81 0936 Darden at SUMEX-AIM colloquium possibilities at Maryland
Date: 10 Sep 1981 0927-PDT
From: Darden at SUMEX-AIM
Subject: colloquium possibilities at Maryland
To: Analogy seminar:, Feigenbaum at SUMEX-AIM, JMC at SU-AI
Hi, Folks, welcome back from IJCAI. I am sorry I didn't get to go;
the system has been very quiet for several weeks.
This is a general message to say that if any of you plan to be in
the Washington D.C. area and have a talk that would be of interest
to philosophers of science and a general interdisciplinary audience,
I would like to know so I can invite you to talk in the colloquium
series of the Committee on the History and Philosophy of Science
at the University of Maryland in College Park (between Washington
and Baltimore but closer to Washington). Sometimes we can work out
a joint sponsorship with the Computer Science Department, as we did
when Bruce spoke in the series in spring, 80. We don't have much
money but can usually manage a small honorarium. We're rather a
congenial bunch and go out for drinks and dinner afterward, so you
might find it a rather pleasant experience, sort of like tea-time
discussions.
Bye, Lindley
-------
∂10-Sep-81 1114 EF@MIT-ML
From: EF@MIT-ML
Date: 09/10/81 14:09:16
EF@MIT-ML 09/10/81 14:09:16
To: JMC at MIT-ML
Hi again, please call me at 617-253-5904
as soon as possible!!!!!!!!!! Ed Fredkin
∂10-Sep-81 1227 FFL
To: JMC, FFL
Fredkin wants the Doctor's Dilemmma - copy sent to MIT-AI or MIT-ML, please.
∂10-Sep-81 1450 reid@Shasta (SuNet) comments from Scott Fahlman on department-wide resources
Date: 10 Sep 1981 14:45:14-PDT
From: reid at Shasta
To: equip
Subject: comments from Scott Fahlman on department-wide resources
------- Forwarded Message
Mail-from: ARPANET host CMU-10A rcvd at 10-Sep-81 1023-PDT
Date: 10 September 1981 1302-EDT (Thursday)
From: Scott.Fahlman at CMU-10A
To: "reid@Shasta" at SUMEX-AIM
Subject: Re: equipment grant
In-Reply-To: reid@Shasta@Sumex-Aim's message of 10 Sep 81 11:29-EST
Message-Id: <10Sep81 130219 SF50@CMU-10A>
Brian,
Department-wide resources seem to me to be a win only if there is some
entity called "the department" to which most of the potential users
feel a substantial degree of loyalty. Here at CMU this exists, but
there is no corresponding sense of university loyalty. At MIT the
natural unit is the Laboratory -- to share resources between AI and LCS
would be fatal, since the groups are mutually hostile and there would
be no thought of making any sacrifices on one side for the good of the
whole community. Don't know where people's loyalty lies at Stanford,
but I have not noticed anyone expressing good feelings about the
department as a whole, just about their favorite part or two. To some
exent, of course, it's a chicken-and-egg problem: if there is at least
some feeling of fraternity among the groups, common facilities can
cement this, but if the feeling is below some threshold, competition
and ill feeling will break out instead.
Happy proposing,
Scott
------- End of Forwarded Message
∂10-Sep-81 1631 pratt@Shasta (SuNet) comments from Scott Fahlman on department-wide resources
Date: 10 Sep 1981 16:30:27-PDT
From: pratt at Shasta
To: equip, reid
Subject: comments from Scott Fahlman on department-wide resources
Speaking as a resource shared between MIT AI and MIT LCS (I belonged to both
labs throughout my nine years there, with equal funding from each lab), I feel
safe in saying that Scott paints an unduly bleak picture of the MIT scene.
There is indeed a lack of cooperation between the labs, but what sharing of
resources does take place, e.g. the ITS operating system, MacLisp, Emacs,
the Rivest-Sussman VLSI collaboration, etc., has hardly been "fatal" - to the
contrary, it has helped in adding a little collagen to an otherwise
disjointed relationship. Were AI and LCS to participate in joint work more
often the effects would be very much to MIT's advantage.
Scott also raised the specter of competitive ill-will being bred by
department-wide resource sharing. Unfortunately any finer-grained system for
acquiring computer resources will at best provide a short term cure for the
symptoms; the competition for resources will remain, but during the planning
stages will be less visible, resulting in less ill-will initially but with
much greater potential for funding disparities. And in the long run the
symptoms, the ill-will, will appear anyway when the money is spent and the
disparities become visible. In particular if ARPA were to grant HPP $1.1M
and then turn around and award only another $0.9M to the rest
of the department, I would be most surprised if this generated no ill-will in
the department. I for one would be bitterly disappointed.
∂10-Sep-81 1651 reid@Shasta (SuNet) facilities
Date: 10 Sep 1981 16:48:48-PDT
From: reid at Shasta
To: equip
Subject: facilities
I have been checking with other universities about the nature of their
recent facilities grants; I have talked to people at Washington, Berkeley,
Texas (no grant awarded there yet), and CMU. Calls pending to Yale and Cornell.
What I find is that all of the places that I have talked to have used
"Feldman-report money" to buy general departmental computing facilities,
with the idea of improving the department as a research community, to
provide a better environment in which to do research, and to attract
better students and faculty.
I am beginning to realize that Stanford is going to end up clearly in the
second rank in this re-industrialization of the nation's computer science
departments: half of our money is ready to go into machines that are
completely useless to all but one faction.
I think that it is all well and good that the HPP get its Lisp cycles,
but as I listen to folks at previously second-flight schools tell me about
the fantastic departmental computing resources that they are building,
I am starting to think that this committee should think about buying
departmental computing resources and not HPP computing resources.
Specifically, I now strongly oppose the purchase of ANY Dolphins with
this money. Dolphins are totally useless to anybody outside HPP.
Symbolics Lisp machines are fine; they aren't Interlisp machines.
But Dolphins are overpriced beasts that are of no use to anybody
who doesn't run Interlisp.
The same argument could be applied to SUN machines: they are relatively
useless to anybody outside the systems group. Naturally I think that
we could turn them into something useful to other groups, but there
is no positive proof that we can. I feel strongly enough about the
non-purchase of Dolphins out of Department money that I am willing
to withdraw my request for SUN machines, if necessary, to emphasize
my belief that this should be a departmental computing facilitya nd
not an HPP computing facility that we are buying.
Brian
∂10-Sep-81 1748 ullman@Shasta (SuNet) meeting
Date: 10 Sep 1981 17:35:53-PDT
From: ullman at Shasta
To: equip
Subject: meeting
Remember the meeting 9:30am Friday!
Please bring your proposals to the meeting, since no one but me
has apparently circulated a proposal.
∂11-Sep-81 0116 ME Ethernet mail from/to SAIL
To: "@SUN.DIS[P,DOC]" at SU-AI
It is now possible to send mail from SAIL to an Ethernet host or from
an Ethernet host to SAIL. However, Ethernet host name scanning for mail
from SAIL is currently done in a temporary manner which recognizes only
the following Ethernet host names: Shasta, Diablo, IFS, Helens. (Also, it
may not be possible to mail directly to Helens from SAIL (or vice versa)
because of a problem with SAIL's Ethernet interface board.) Ethernet
destinations are specified to MAIL the same way ARPAnet destinations are:
e.g., FROST % DIABLO or FROST@DIABLO (note absence of spaces in the "@"
form). Bug reports about the Ethernet mail service on SAIL should be
mailed to BUG-MAIL at SAIL (type GRIPE MAIL<cr>). Please bear with us
while we try to clean up the host name parsing.
Note: MAIL forwarding to Ethernet hosts from SAIL is now possible. If you
want your SAIL mail forwarded somewhere, then mail a message to FORWARD at
SAIL explaining what forwarding you would like. (Because of the problems
with reaching Helens from SAIL, forwarding to Helens directly will not be
attempted.)
(Ethernet mail is up on SAIL because of the work of MRC, TVR and BH.)
∂11-Sep-81 0509 Robert Elton Maas <REM at MIT-MC> Compression and noise
Date: 11 September 1981 07:58-EDT
From: Robert Elton Maas <REM at MIT-MC>
Subject: Compression and noise
To: DEVON at MIT-MC
cc: REM at SU-AI, RWW at SU-AI, JMC at SU-AI
Date: 9 September 1981 04:06-EDT
From: Devon S. McCullough <DEVON at MIT-MC>
Is your method suitable for interactive as well as FTPing?
Yes, that's one of its two main values (1) it codes in realtime directly
from the histograms, so it doesn't require a pre-pass on the data nor even
knowledge of expected statistics, it just assumes it can learn as it
goes along, (2) it is a general method that can work from any explicit
stochastic model, it's not hardwired to a particular alphabet or model.
With a terminal you get line noise,
With any advanced compression method you *NEED* an errorfree pipeline for the
compressed data. This means before you can effectively use it on
an error-prone line, you have to install some error-correcting protocol,
such as PCNET, DIALNET, X.25, etc. Then on top of that subnet you
write your data-compression software.
and never know how long you'll
be waiting for the next character to flow in either direction.
There's a simple solution that I employed in a Huffman-code algorithm
I implemented and used for a while a few years ago. When about to
finalize a packet, you check for additional data that has arrived,
and when such data is exhausted and you're really ready to send the
packet you add a null byte to the uncompressed stream. The null byte
has an artificially-low probability in the model, hence an artificially-long
codelength. Thus it stuff enough data into the compressed stream as to
force out the last real character from the decoding process on the
other end. When new data arrives later, it forces the null byte out
the decoding process. Thus all normal data is forced out from from the
same packet it went into at the last transmission before a pause, while
the artificial null byte doesn't really arrive at the other node until
the first packet when data resumes after the pause. But the null byte
carries no informatin so its delay doesn't hurt any.
The combination of these two makes error-checking a hassle.
Nope. Just use both the above methods, subnet for error-checking,
exchanging packets of compressed data, and artificial null byte
at any pause to force out the last byte of real data before pause.
∂11-Sep-81 1034 FFL
To: JMC, FFL
Please call Dr. Edward Teller. 7-0601.
It was about some opus on using AI to control reactors by one
Chandrasekhar or something like that.
∂12-Sep-81 0103 PMF
You mentioned once that you were interested some Analog articles
on a scheme where orbiting stations would grab rockets from orbit (thus
allowing a rocket to get into space for the energy it takes to get to
orbital height, but without orbital velocity). Are you still interested?
I have the article.
Yes. I would like to see it.
∂12-Sep-81 1129 RPG@Sail (SuNet) Considerations
Date: 12 Sep 1981 1125-PDT
From: Dick Gabriel <RPG at SU-AI>
Subject: Considerations
To: equip at SHASTA, (sunet) at Sail
Friday Jeff started to ask a question about the terminal
system which I think no one allowed him to finish, so I will and
will attempt to answer it. He was asking, even though the JMC
terminal system is $2500 and the SUN system is $7500, what are
the advantages of each in terms of functionality?
In my view there is a tremendous advantage to the SUN system, akin
to the following. We could compare a Volkswagen and an F14. We begin by
talking about the taxiing ability of the F14 and conclude that it does not
provide quite as cost effective a commuter car as the VW, plus it's too expensive.
We go away satisfied that our analysis was devastating and complete.
In reality with the SUN we can achieve things not yet fully realized in
terms of user environments. For example, with the SUN one is able to achieve
finally the goal of uniform environment. That is, with a SUN running your favorite
editor you can interact with any system or program with exactly that same
communicative interface. This is only approximately achieved with the JMC scheme.
I believe that this use itself justifies the expense of the system.
A second point about the entire discussion is that there seems to be a
maniacal love of arguing ``bucks per bang'' to the highest decimal point. Is there
no concern for quality in this committee? Speaking as a person who once was and
is still considered a hacker, I have to report that productivity is strongly
correlated with the quality of the equipment (hardware and software) in terms of
its ability to respond to my needs as they occur. In JMC's view, the importance
of response time is minuscule in comparison to think time. This may be true in
situations where the final result of the computation is simply a better
understanding of some abstraction. However, when one is building a system, or
debugging huge segments of code there then exists a symbiosis between the
programmer and the system. It simply is not true that there is a clear distinction
between the man and machine in terms of where the thought process is centered.
Anyone who has worked with good tools in a workshop can appreciate that the tools
are an extension of the person not just some incidental artifacts.
Let us simply make some choices based on quality (not luxury) in this
committee.
Finally, 1 Lisp Machine for the Formal Reasoning group is a fine
quantity. My only question is, what will the other members of the group
(besides me) do for computing?: I will be using that machine constantly.
-rpg-
∂12-Sep-81 2120 LLW Starting Next Week
To: JMC
CC: LLW, TM, CEG
∂11-Sep-81 2355 JMC
Are you expecting me Monday?
[John: I wasn't until last nite, when Dick mentioned that you would be
coming over with him on Monday; my (possibly faulty) recollection was that
you were going to call me a few days before you wanted to start. I'm not
sure how much notice the Personnel people need to start you--it's
completely possible that they can do so on Monday. If you're going to be
leaving Stanford after 0815 or so on Monday morning, you can call Paula
Bauman at 422-0758, and get the indeterminacy resolved; otherwise, come on
ahead, and we'll wing it! Alternatively, if you want a possibly less
hassled start-of-the-week, plan on showing up here Tuesday AM, and we'll
have the red carpet out. Lowell]
Let's make my start Tuesday then.
∂13-Sep-81 1045 CLT
Could we please return the TV cart? The more I think about it the less
I like it. I'd rather use the piano bench until something better is
found.
∂13-Sep-81 1704 Purger exceeding your disk quota
You are exceeding your disk quota.
Files that occupy space beyond your quota are subject to purging.
If you don't delete some of your files, the purger will.
There will probably be a purge in the next 24 to 48 hours if
there are not more than about 2500 free disk blocks.
Your disk quota is: 4080
Your files occupy 4100
∂14-Sep-81 0945 CLT
if you would take the tv off the table and put the packing case by it
i will disassemble and take it back to Macy's myself, today.
∂14-Sep-81 1126 CSD.ENGELMORE@SU-SCORE (SuNet) Proposed equipment
Mail-from: ARPANET host SU-SCORE rcvd at 14-Sep-81 1116-PDT
Date: 14 Sep 1981 1115-PDT
From: Bob Engelmore <CSD.ENGELMORE at SU-SCORE at SUMEX-AIM>
Subject: Proposed equipment
To: equip at SU-SHASTA
Since we didn't arrive at any closure at the last meeting, I'd like to
suggest what I think is a sensible proposal to ARPA, in light of the
discussions we've had and also with the assumption (which apparently is
reasonable, according to a recent discussion with Bob Kahn) that we can
count on funding over three years.
I've removed the NA Vax and the Diablo purchase items from Jeff's list,
because I don't think they're appropriate items for the ARPA proposal.
I also eliminated the cheap terminals because I think we can get along
without them if we get the terminals listed below, plus terminals
already on hand. However, I wouldn't object if they remained on the
list, spread over three years, as that puts their cost down in the
noise. On the current controversy over SUN stations vs. the "McCarthy"
low-cost display terminal, I don't feel very strongly one way or the
other, so I put down 100 of each (do we really need more than 200 of
these beasts to serve the CSD/ARPA community?). However, I would favor
the SUN station if the McCarthy terminal can't significantly help in
off-loading the clerical work on Score.
The main new item I've added is Maintenance. Remember, we're not
proposing to NSF. ARPA has a more reasonble attitude about supporting
the equipment it buys. I think we'll be in serious financial difficulty
if we don't include money for maintenance. My estimate is very rough,
on the order of 10% per year, and I'd welcome a better guess.
I also added the single-user VAXen (five + file server), mainly because
it's a bargain. Although I don't know who will use them (or where we'll
put them), I suspect some group will put them to good use after we get
them.
Another addition is more "Dolphins" in year 2 (more likely the Star
modified to run Interlisp). The HPP has discussed this at length, and
is convinced that it needs a personal computing environment of at least
one work station per two researchers to do its contracted research
effectively.
ITEM 1982 1983 1984 TOTAL
1. S1 $500 $500
2. Dolphins (15) 540 360 900
3. Symbolics (5) 375 375
4. Foonly File Server 225 225
5. SUN (100+development) 375 250 125 750
6. McCarthy terminals (100) 150 100 250
(Including development)
7. Ethernet equipment 55 55 110
8. Star printers 90 60 60 210
9. SUVax 11/750 (5 + 1) 195 195
10. Local ethernet and local 150 150 300
file store purchase
and development
11. Maintenance 200 300 350 850
TOTAL $2,205 $1,775 $685 $4,665
-------
∂14-Sep-81 1238 RPG@Sail (SuNet) Lisp
Date: 14 Sep 1981 1237-PDT
From: Dick Gabriel <RPG at SU-AI>
Subject: Lisp
To: equip at SHASTA, (sunet) at Sail
At the risk of appearing a boor, let me reiterate my observations
about the Lisp needs of the community in my perception. First,
assuming HPP to be 100% InterLisp users, 15 Dolphins for InterLisp
implies 7 or 8 Lisp Machines. Second, I believe that HPP is not 100%
InterLisp. Third, why not order the $60k Symbolics Lisp Machines instead
of the CADR lookalike since it will run Common Lisp?
-rpg-
∂14-Sep-81 1431 ENGELMORE@SUMEX-AIM (SuNet) Amended wish list
Date: 14 Sep 1981 1426-PDT
From: Engelmore at SUMEX-AIM
Subject: Amended wish list
To: RPG at SU-AI
cc: equip at SU-SHASTA
Dick,
Yes, you're right, HPP is not totally committed to Interlisp, and I would
like to amend my previous msg as follows:
1) Reduce the number of Dolphins in the first year from 9 to 6.
2) Increase the number of Symbolics 3600 machines (@60K) in the second
year from zero to 3.
This would keep the total cost the same, and would bring the first and
second year costs closer together. The total number of Dolphins would
be 12 and the total number of Lisp machines would be 8.
Thanks for the reminder. I really want the Common Lisp project to
succeed, and we ought to be ready to use the language when as soon as
it's available.
Bob
-------
∂14-Sep-81 1431 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) MTC Qual
Date: 14 Sep 1981 1429-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: MTC Qual
To: JMC at SU-AI, ZM at SU-AI
Zohar said you had an addition to make to the MTC Qual reading list.
Please send it to me as soon as possible.
The Qual will be scheduled for Monday, Dec. 14.
Carolyn
-------
∂14-Sep-81 1522 RINDFLEISCH@SUMEX-AIM (SuNet) Re: Lisp
Date: 14 Sep 1981 1515-PDT
From: Rindfleisch at SUMEX-AIM
Subject: Re: Lisp
To: RPG at SU-AI, Equip at SU-SHASTA
In response to your message sent 14 Sep 1981 1237-PDT
My own feeling is that we should not get too hung up about the exact
mix of Symbolics machines versus Dolphin/Stars but rather concentrate on
how many personal Lisp machines are needed total to support the groups
interested in that approach -- apparently HPP and part of SAIL. There
are enough contingencies with either approach that planning is
uncertain:
Will the Symbolics 3600 make the scene as planned?
Will Common Lisp come off?
Will Xerox continue to screw around in marketing Dolphins and
supporting software?
Will Interlisp Star come off?
...
Bob's main point is that HPP sees the need for about 20 machines over
the next two years to reach hardware "critical mass" for its own user
community. If SAIL sees a need for additional LISP machines of its own,
these should be factored in.
As far as cost is concerned, I'm not sure what "$60K" Symbolics machines
Dick is talking about. The latest (August) Symbolics price list for the
coming 3600 is:
Basic machine (256K word memory, 100-200 Mbyte disk
800 x 1000 display, keyboard, mouse, Chaosnet,
2 asynch lines, and software) $75,000
Add-on memory (256K board, up to 3 possible) 11,000
Color display (1000 x 1000) 25,000
300 Mbyte disk instead of standard disk 13,770
Multi-bus card cage 3,250
It is not clear how much extra memory, if any, will be needed to make
these machines perform properly but we will likely need the Multi-bus
facility to make a 3 Mbit/sec Ethernet connection. This comes to about
$80K unless there is some deal I'm unaware of. Has someone negotiated
an educational discount with Symbolics? $80K would be $20K more than
the current Dolphin price and over 20 machines is a lot of bucks. Still,
performance and Common LISP community advantages may make this
worthwhile...
Tom R.
-------
∂14-Sep-81 1530 RPG@Sail (SuNet) Lisp
Date: 14 Sep 1981 1528-PDT
From: Dick Gabriel <RPG at SU-AI>
Subject: Lisp
To: equip at SHASTA, (sunet) at Sail
My figures on pricing the Symbolics 3600 comes from a discussion with
Weinreb last thursday. I'm at least under the impression that `cronyism'
will get us a good price on them; the price I quoted in my hastily assembled
blurb of last friday is for the hardware described.
I, too, believe we should simply make room in the proposal for lots of
Lisp money, but I also want to make sure our interim mix looks plausible to ARPA.
-rpg-
ps I am on EQUIP and do not need 2 copies of each message.
∂14-Sep-81 1907 TW
To: JMC, JJW
∂14-Sep-81 1347 JJW Comprehensive Committee
I've got a copy of the revised syllabus from Carolyn and made the
changes you noted. As I understand it, this is the final syllabus for
the upcoming exam in January.
Was the book on logic (by Kowalski) which John McCarthy suggested
discussed over the summer? I am wondering why it hasn't appeared on the
reading list.
Joe
I must not have been at the meeting where it was discussed.
I'll check with him about it. --t
∂14-Sep-81 1936 RPG
∂14-Sep-81 1826 JMC
Let's go to Livermore together tomorrow.
Ok, how about if I meet you at school at 10am?
-rpg-
∂14-Sep-81 2111 JJW EKL Reference Manual
To: JK, JMC, JMM
The EKL manual is now in a relatively complete state. I've included
examples of most of the commands, and reorganized some of the sections.
There isn't much time left before it gets reproduced for 206 class
notes, but if you are able to proofread it, please send me any corrections
or suggestions. You can Dover my file EKLMAN.PRE[EKL,JJW] to get a copy.
∂15-Sep-81 0143 Richard M. Stallman <RMS at MIT-AI>
Date: 15 September 1981 04:41-EDT
From: Richard M. Stallman <RMS at MIT-AI>
To: jmc at SU-AI
Hello, have you looked at META >?
Should I make plans to come out to Stanford this fall?
I looked at it some, and I didn't think it was on the right track.
However, I'll look at it again, send you a message about it. Right
now I'm thinking about different questions, and I'm not in a position
to interact. Maybe I will be able to send you a message about coming
out or not in by the end of the month.
∂15-Sep-81 0417 energy at MIT-MC
Date: 15 September 1981 07:16-EDT
From: energy at MIT-MC
Sender: OAF at MIT-MC
To: energy
Date: 11 September 1981 1406-PDT (Friday)
From: lauren at UCLA-Security (Lauren Weinstein)
Subject: The Energy Crisis is OVER!
To: ENERGY at MC
I hereby declare the energy crisis finished! Why? A local gasoline
chain (USA Gas), has begun a CONTEST! ALL RIGHT! Shades
of Wickki Wickki dollars (anybody remember THOSE!?)
--Lauren--
∂15-Sep-81 0831 FFL AUTOMATIC BANK DEPOSIT OF CHECKS
To: JMC, FFL
Please bring me one of the new deposit slips so I may complete the
authorization form. After you sign it, it will be changed to the new
account.
∂15-Sep-81 0916 RPG
∂14-Sep-81 2332 JMC
OK, ten it is. Do they generally start late there?
Not at LLL, but I do... Also, no one at S-1 starts early.
-rpg-
∂15-Sep-81 1021 Baskett at PARC-MAXC attractive machine offer from DEC
Date: 15 Sep 1981 10:18 PDT
From: Baskett at PARC-MAXC
Subject: attractive machine offer from DEC
To: csl.lab.dra@score,csl.fb@score,csl.jhc@score,csl.m@score,csl.jlh@score,
csl.lantz@score,csl.ver.dcl@score,csl.crc.ejm@score,csl.meindl@score,
csl.sso.owicki@score,csl.bkr@score,csl.fat@score,csl.da.wvc@score,
csl.sun.jfw@score,csd.wiederhold@score,feigenbaum@sumex-aim,goulb@score,
ullman@score,jmc@sail,dek@sail,gorin@score,tob@sail,buchanan@sumex-aim,
oliger@score,schreiber@score,winograd
DEC has offered to sell, to the Arpa community, a very attractivly priced
"personal VAX". An Arpa institution must buy 5 (five) and must be engaged in
"personal computing research" to qualify. The "personal VAX" is a 750 processor,
2 megabytes of main storage, and 50 megabytes of disk storage. The price for
this configuration is $34K. This makes a hardware package that is competitive
with the Xerox Star and clearly and completely dominates the Xerox 1100
(Dolphin), Perq, Apollo, and the different varieties of Lisp machines. The 750
processor is about half the CPU speed of the 780 processor but it has more I/O
performance than the 780 processor so many applications will actually run faster
when the total system performance is measured. The processor is about twice the
CPU power of the Dolphin and quite a bit faster in I/O performance. It seems
clear (to me) that MIT (at least the 5th floor crowd) will buy these as their next
computing system (scratch Apollo, Dolphin, Nu, Lisp Machine, etc.). It also
seems clear to me that this offer may well spell the end of Interlisp. The
reasoning behind this thought is that MIT (and CMU) will develop whatever the
current most popular variant of MacLisp for the VAX and it will take over the
AI community, for the most part. It will outperform Dolphin Interlisp (my
prediction!) and cost half as much as be a regular DEC product rather than a
poorly supported pseudoproduct from a corner of Xerox. And the Dolphin seems
to be the only thing giving Interlisp any future right now. In addition, this
configuration looks ideal for applications like file servers. Buy large 2nd source
Unibus compatible disk drives for quite reasonable prices and add them and you
have it, better and cheaper than any of the obvious alternatives. We could do
two or three! Ethernet boards and software are no problem, of course. I could go
on and on about this, but it all seems so obvious.
I (that's me) don't think that this offer displaces Sun workstations. Sun
workstations and VAXes work very well together already. And this personal
VAX doesn't have any kind of reasonable display.
I would think that the computing facilities committee would want to meet again
and carefully consider this extraordinary offer.
Forest
------------------------------------------------------------
∂15-Sep-81 1034 pratt@Shasta (SuNet) CSL reps
Date: 15 Sep 1981 10:30:28-PDT
From: pratt at Shasta
To: equip
Subject: CSL reps
At present Brian is the only CSL representative on this committee, as against
three HPP reps (Ed, Tom, Bob). This correlates with the numbers on the
suggested budgets more than I'm comfortable with. How about adding
Keith Lantz to the committee?
∂15-Sep-81 1058 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Faculty Meeting, Monday, Sept. 28
Date: 15 Sep 1981 1051-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Faculty Meeting, Monday, Sept. 28
To: CSD-Faculty:
cc: CSD.BScott at SU-SCORE, Admin.Gorin at SU-SCORE, TOB at SU-AI, SL at SU-AI,
CSD.HBrown at SU-SCORE, VRP at SU-AI, CSD.Cheriton at SU-SCORE
Please note change in day and place of faculty meeting.
MONDAY, September 28, 2:30 p.m., Jacks 146 (first floor)
Please send agenda items to Prof. Golub.
-------
∂15-Sep-81 1154 Mike Genesereth <CSD.GENESERETH at SU-SCORE> Re: se2
Date: 15 Sep 1981 1151-PDT
From: Mike Genesereth <CSD.GENESERETH at SU-SCORE>
Subject: Re: se2
To: JMC at SU-AI
In-Reply-To: Your message of 17-Aug-81 0205-PDT
I'm sorry I somehow missed your note in August about SE2. The answer is
that I would indeed be interested. Please pass my name on to Prof. Bloom.
Thanks.
mrg
-------
Please call Elliott Bloom 282469 at SLAC and ask him or his secretary to
put Mike Genesereth on SE2 list.
∂15-Sep-81 2305 FEIGENBAUM@SUMEX-AIM (SuNet) baskett
Date: 15 Sep 1981 1814-PDT
From: Feigenbaum at SUMEX-AIM
Subject: baskett
To: engelmore at SUMEX-AIM
cc: equip at SU-SHASTA
Mail-from: ARPANET host PARC-MAXC rcvd at 15-Sep-81 1021-PDT
Date: 15 Sep 1981 10:18 PDT
From: Baskett at PARC-MAXC
Subject: attractive machine offer from DEC
To: csl.lab.dra@score,csl.fb@score,csl.jhc@score,csl.m@score,csl.jlh@score,
csl.lantz@score,csl.ver.dcl@score,csl.crc.ejm@score,csl.meindl@score,
csl.sso.owicki@score,csl.bkr@score,csl.fat@score,csl.da.wvc@score,
csl.sun.jfw@score,csd.wiederhold@score,feigenbaum@sumex-aim,goulb@score,
ullman@score,jmc@sail,dek@sail,gorin@score,tob@sail,buchanan@sumex-aim,
oliger@score,schreiber@score,winograd
DEC has offered to sell, to the Arpa community, a very attractivly priced
"personal VAX". An Arpa institution must buy 5 (five) and must be engaged in
"personal computing research" to qualify. The "personal VAX" is a 750 processor,
2 megabytes of main storage, and 50 megabytes of disk storage. The price for
this configuration is $34K. This makes a hardware package that is competitive
with the Xerox Star and clearly and completely dominates the Xerox 1100
(Dolphin), Perq, Apollo, and the different varieties of Lisp machines. The 750
processor is about half the CPU speed of the 780 processor but it has more I/O
performance than the 780 processor so many applications will actually run faster
when the total system performance is measured. The processor is about twice the
CPU power of the Dolphin and quite a bit faster in I/O performance. It seems
clear (to me) that MIT (at least the 5th floor crowd) will buy these as their next
computing system (scratch Apollo, Dolphin, Nu, Lisp Machine, etc.). It also
seems clear to me that this offer may well spell the end of Interlisp. The
reasoning behind this thought is that MIT (and CMU) will develop whatever the
current most popular variant of MacLisp for the VAX and it will take over the
AI community, for the most part. It will outperform Dolphin Interlisp (my
prediction!) and cost half as much as be a regular DEC product rather than a
poorly supported pseudoproduct from a corner of Xerox. And the Dolphin seems
to be the only thing giving Interlisp any future right now. In addition, this
configuration looks ideal for applications like file servers. Buy large 2nd source
Unibus compatible disk drives for quite reasonable prices and add them and you
have it, better and cheaper than any of the obvious alternatives. We could do
two or three! Ethernet boards and software are no problem, of course. I could go
on and on about this, but it all seems so obvious.
I (that's me) don't think that this offer displaces Sun workstations. Sun
workstations and VAXes work very well together already. And this personal
VAX doesn't have any kind of reasonable display.
I would think that the computing facilities committee would want to meet again
and carefully consider this extraordinary offer.
Forest
------------------------------------------------------------
-------
∂15-Sep-81 2306 ullman@Shasta (SuNet) CSL reps
Date: 15 Sep 1981 18:20:44-PDT
From: ullman at Shasta
To: equip, pratt
Subject: CSL reps
1. Dave Cheriton is also on the committee and is as much CSL as Keith is.
2. The matter is not going to be taken to vote. There is only one vote,
and that is Bob Kahn's.
∂15-Sep-81 2307 ENGELMORE@SUMEX-AIM (SuNet) meeting with Bob Kahn
Date: 15 Sep 1981 2241-PDT
From: Engelmore at SUMEX-AIM
Subject: meeting with Bob Kahn
To: equip at SU-SHASTA
Bob Kahn will be here on Thursday. I don't recall if anyone has set up
a specific time and place for the committee to meet with him. If not,
let's make the time 2:30 (it can't be earlier than that) and the place
Room 252 in MJH.
Bob
-------
∂15-Sep-81 2339 Feigenbaum at SUMEX-AIM retransmission
Date: 15 Sep 1981 2338-PDT
From: Feigenbaum at SUMEX-AIM
Subject: retransmission
To: csl.lantz at SU-SCORE, csl.ver.dcl at SU-SCORE, csl.crc.ejm at SU-SCORE,
csl.meindl at SU-SCORE, csl.sso.owicki at SU-SCORE, csl.bkr at SU-SCORE,
csl.fat at SU-SCORE, csl.da.wvc at SU-SCORE, csl.sun.jfw at SU-SCORE,
csd.wiederhold at SU-SCORE, csd.golub at SU-SCORE,
csd.ullman at SU-SCORE, jmc at SU-AI, dek at SU-AI, reg at SU-AI,
tob at SU-AI, buchanan at SUMEX-AIM, csd.oliger at SU-SCORE,
csd.schreiber at SU-SCORE, tw at SU-AI, rindfleisch at SUMEX-AIM,
engelmore at SUMEX-AIM
Date: 15 Sep 1981 2333-PDT
From: Feigenbaum
Subject: Re: attractive machine offer from DEC
To: Baskett@PARC-MAXC, csl.lab.dra@SCORE, csl.fb@SCORE,
To: csl.jhc@SCORE, csl.m@SCORE, csl.jlh@SCORE
cc: feigenbaum
In response to the message sent 15 Sep 1981 10:18 PDT from Baskett at PARC-MAXC
I was one of the signatores on the proposal that led to this "DEC deal"
for the ARPA community, having been one of the people who was bugging
DEC regularly for some reasonable entry into the "personal scientific
workstation" market. I want to agree generally with Forest that these
Vaxen are a good deal. But I want to add that I think Forest went way overboard
in his enthusiasm, vastly overstating the case for these 11/750s beating
out any of the LISP machines in the LISP market.
A lot of study and a lot of work has already gone into LISPs for the VAX,
and the conclusions (tentative) are not optimistic for the VAX as an
effective LISP engine, when compared with the "finely honed" machines
that do most of their LISP processing in their microstores with well-
thought-out LISP "instructions". For example, see Masinter's report on
VAX-INTERLISP, which is informally available and will soon come out as
a CSD/HPP report. I predict that none of Forest's assessments of
LISP-on-VAX will come true, i.e. that the arrival of these "good deal"
VAXen will have no impact on the thriving LISP machine world; that
if VAX-INTERLISP ever gets done, it will not be more effective (faster,
cheaper) than INTERLISP-Dolphin; that probably Common Lisp on the PERQ
will outperform Common LISP on the 11/750.
One should be able to get benchmark timings today to find out if the
11/750 will even outperform the PERQ on running PASCAL. Maybe not.
Tempering enthusiasm with reality, it still remains true that the VAX
will see a sea of software in the next half-decade--and has good
I/O throughput as Forest mentions--so the deal is still pretty good
for CSD, even if the LISP enthusiasts are not too excited. The deal
should look particularly good to systems researchers.
I am in favor, therefore, of asking ARPA for the money to acquire
the "minimum configuration", i.e. the five plus file server. It comes
to only about 10% of the proposal budget we are considering for Year 1.
Ralph will have kittens. Where will he put all this (fairly bulky)
equipment?
Ed F.
p.s. in reviewing my message, I note that I forgot to remark that the
other "personal scientific workstations" have very well-integrated,
beautiful displays, and that as Forest points out, the proposed
single-user-VAX configuration does not. That means that Stanford people
will want to use a SUN termina on this machine. (Which raises the
interesting question of what to do with the displays that come with
the configuration? Sell then to San Jose State for money to build
more SUN stations?)
-------
-------
∂16-Sep-81 0057 RPG@Sail (SuNet) Baskett's Lisp Analysis
Date: 16 Sep 1981 0055-PDT
From: Dick Gabriel <RPG at SU-AI>
Subject: Baskett's Lisp Analysis
To: equip at SHASTA, (sunet) at Sail
I hate to mention it but Forest's analysis of the Lisp situation regarding
the personal Vax is, to be polite, uninformed. First of all, he is unaware
of the current status of Lisp implementations and accompanying folklore
and, second, crunch per buck is irrelevant to AI researchers when address
space and absolute crunch matter.
Comparing processor powers of CPU's when the CPU's are essentially
aimed at radically different instructions sets is a task that I approach
with timidness because it is extremely difficult to measure, let alone
analyze, these things. For example, what can processor power mean? Suppose
a lisp machine (no caps) runs at 1 MIPS and a vax (no caps) runs at 3 MIPS.
What does an instruction accomplish? Suppose CONS is 10 vax instructions
and 1 lisp machine instruction? Suppose a lisp machine can move pointers
and validate tags on the way? Suppose a lisp machine can dispatch on types
in 1 instruction? On `stock' hardware these things are elaborate sequences
of instructions. The memory architectures are radically different.
Comparing them casually is madness.
Most importantly, a personal 780 is more like what you need to run any kind
of Lisp on a Vax for reasonable performance. First, the paging on a Vax is
simply intolerable given the scattered nature of non-cdr coded Lisps. Second,
since this hardware is not tagged, it cannot support data encoded types, but
address encoded types only (Bibop). Third, without microcode support one
cannot get invisible pointers which is critical for cdr-coding.
Therefore, a Vax is bound and determined to lose in the most creative and
pervasive way on Lisp.
I am in the position of knowing about the various MIT and CMU Lisp efforts
and about the Vax Lisp efforts of various flavors, and none are optimistic
about the performance of any Lisp on a any Vax. CMU will NOT produce a SPICELISP
to run on a VAX, period.
I don't believe that Forest's comments should change anyone's opinion about
what to do about Lisp cycles.
-rpg-
∂16-Sep-81 0810 JRP terminals
I believe I have secured funding for a terminal, and want to move quickly
so as to have one by the time you foreclose on this one. The simplest thing
would be to buy this one. Gorin says it was bought on your unrestricted funds
Would you be willing to sell it, and if so for how much? A new datamedia
with modem and etc. would apparently be about $3000. If a get a new terminal,
it will probably be something less elegant, since it is easy for me to get
the first $1800 but much harder after that.
j.perry
∂16-Sep-81 0916 RINDFLEISCH@SUMEX-AIM (SuNet) Interlisp VAX Report
Date: 16 Sep 1981 0856-PDT
From: Rindfleisch at SUMEX-AIM
Subject: Interlisp VAX Report
To: System at SUMEX-AIM
cc: Interlisp-VAX-Rpt-List:
The SUMEX project at Stanford commissioned Dr. Larry Masinter of Xerox
PARC to assess the status and prospects of the USC-ISI Interlisp
implementation for the VAX. A report on this study will be published as
a Stanford CSD/HPP Technical Report. A final draft is available now
on-line at SUMEX as <LISP>INTERLISP-VAX-RPT.TXT and .PRESS. Copies can
be FTP'ed ANONYMOUSly.
Tom R.
-------
∂16-Sep-81 1031 FFL
To: JMC, FFL
Dr. Bloomis secretary had a call inquiring about a chapter of SE2 in the LA
area. Is there one, and who should be contacted?
I think there are some people. Les Dugan should be contacted.
∂16-Sep-81 1033 FFL
To: JMC, FFL
The change in your automatic check deposit cannot take effect until
the check which you will receive on October 7. So I guess you should watch
your bank for the deposit of Sept. 22, to be sure they get it into the correct
account.
∂16-Sep-81 1222 RPG
∂16-Sep-81 1110 JMC multi-processing in common LISP
After talking to with Erik and pondering for a while, I began to conjecture
that the best way to get a multi-processing experiment of the kind I want
might be in LISP after all even though LISP programs aren't likely to be
the ones that will need it most. I haven't looked through the Common LISP
manual to see what there might be yet but will do so when I get to Livermore
towards which I'm leaving now. Can you phone me there after 1pm or MAIL me
a message with a phone number.
Common Lisp itself does not provide anything in the way of multiprocessing
outside of the stack group mechanism. S-1 Common Lisp will, however,
though we have not decided on the primitives at the moment. We have, though,
provided for the eventuality by restructuring the runtime system to
allow interrupts between any 2 instructions, and we have gone to a deep
binding scheme (with caching).
-rpg-
∂16-Sep-81 1415 RPG I'm
at 497-2462
∂16-Sep-81 1507 UNTULIS at SRI-AI Re: badge
Date: 16 Sep 1981 1457-PDT
From: UNTULIS at SRI-AI
Subject: Re: badge
To: JMC at SU-AI
cc: UNTULIS at SRI-AI
In-Reply-To: Your message of 16-Sep-81 1351-PDT
Thanks for the information. I will notify people about the loss and
get you a new badge.
Chuck
-------
∂16-Sep-81 1435 RINDFLEISCH@SUMEX-AIM (SuNet) 11/750 DEAL
Date: 16 Sep 1981 1432-PDT
From: Rindfleisch at SUMEX-AIM
Subject: 11/750 DEAL
To: Equip at SU-SHASTA
I am very much interested in one of the subsidized 11/750's as a file
server for the SUMEX/HPP community. Presumably there will be a separate
proposal written to DEC for these. Count us in...
Tom R.
-------
∂16-Sep-81 2334 Jerry E. Pournelle <POURNE at MIT-MC> conference
Date: 17 September 1981 02:34-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
Subject: conference
To: JMC at SU-AI
Please advise date and time of arrival at confernce;
Mrs. Niven getting slightly nervous about numbers she will have
to feed and etc.
Obviously $150 fee intended as means of extracting money
from firms willing to pay, not required for those paying own
expenses; donations for meals will be accepted of course; checks
to L-5 are deductible.
Hans Mark definitely coming Friday evening and all day
Saturday. Thursday session preparatory and informatory as we try
to get each other up to speed on possibilities.
JEP
∂17-Sep-81 0752 RINDFLEISCH@SUMEX-AIM (SuNet) FYI RE COMMON LISP - PROMPTED BY MASINTER'S INTERLISP VAX RPT
Date: 17 Sep 1981 0745-PDT
From: Rindfleisch at SUMEX-AIM
Subject: FYI RE COMMON LISP - PROMPTED BY MASINTER'S INTERLISP VAX RPT
To: HPP-Exec:, Equip at SU-SHASTA
cc: RINDFLEISCH at SUMEX-AIM
Mail-from: ARPANET host CMU-10A rcvd at 16-Sep-81 1921-PDT
Date: 16 September 1981 2100-EDT (Wednesday)
From: Scott.Fahlman at CMU-10A
To: Rindfleisch at SUMEX-AIM
Subject: Re: Interlisp VAX Report
In-Reply-To: Rindfleisch@SUMEX-AIM's message of 16 Sep 81 16:23-EST
Message-Id: <16Sep81 210050 SF50@CMU-10A>
Tom,
Common Lisp is coming along well, though I can only speak for the parts that
we are doing here. We haven't had to make too many ugly compromises to get
agreement on a common manual. Some parts of the manual are still not
written or are being debated, but basically it looks good. Parts of the
Spice Lisp implementation are running on the TOPS-20 emulator and are being
debugged there; we should have something we can call a Lisp running any week
now. 3RCC has put all of the changes we needed into the new Perq processor
board, and we should have a prototype in our hands by mid-October. With
any luck at all we'll have a usable Lisp running on the extended Perq by
December or so, and things like editors and fancy debuggers appearing
steadily after that. We are trying to scrape up the money to get several
of the new Symbolics machines, and hope to convert Spice (not just the Lisp)
to run on this machine next summer. All in al, things feel pretty good.
The only part that worries me is whether the VAX version (alias NIL) will
in fact be appearing from Jonl's end -- they're not getting much support.
-- Scott
-------
∂17-Sep-81 1056 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) MTC Qual Dec. 14
Date: 17 Sep 1981 1017-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: MTC Qual Dec. 14
To: PHD-Distribution-list:
cc: ZM at SU-AI, JMC at SU-AI
The MTC Qual will be held Monday, Dec. 14. Please send me a message if
you plan to take it.
The REading list is almost complete. Prof. McCarthy plans to make one
addition. It will be ready by Monday, Sept. 28, Registration Day.
Carolyn
-------
∂17-Sep-81 1423 NEUMANN at SRI-KL VERkshop II; Berkeley Symposium
Date: 17 Sep 1981 1400-PDT
From: NEUMANN at SRI-KL
Subject: VERkshop II; Berkeley Symposium
To: VERKshop: ;
VERkshop II issue of SEN (July 1981)
Although ACM screwed up my request for extra copies of the July 1981
issue, they now promise to send me a few. Please let me know if you
do not have one and would like one. I will dispense what I get
on a first-come-first-served basis.
For your info, VERkshop III if it were to exist might be held on
29-30 April on the west coast, following the Berkeley conference
on 26-28, to minimize travel for those of you who would be involved
in that. On the other hand, if there is not more money for the
verification community soon, there may not be a community left to
convene. April and May look like very busy months, with conflicts
each week -- particularly with the network community.
Again for your info, those of you who are interested in security might
want to think about the following announcement for the Berkeley meeting.
Peter
-=-=-=-=-=-=-=
Berkeley Symposium
The 1982 Symposium on Security and Privacy will take place on 26-28
April 1982, at the Claremont Hotel in Oakland/Berkeley, California.
The General Chairman is Roger Schell of NSA (Computer Security
Evaluation Center, Ft. George G. Meade MD 20755, phone 301-688-7123).
The Program Cochairmen are Peter G. Neumann of SRI (Menlo Park CA
94025, phone 415-859-2375) and Robert Morris of Bell Labs (Murray Hill
NJ 07974, phone 201-582-3878).
Papers and proposals for panel sessions related to security and
privacy are being solicited. Possible topics include encryption, data
base security, operating system and application security, network
security, formal models, formal verification, and privacy protection.
In addition, effort will be made to provide a common middle ground
between the encryption and system security communities, which in the
past have been largely nonoverlapping. Both theoretical and practical
contributions are encouraged.
Please submit for review by 1 February 1982 six copies of your paper
or panel proposal to Dr. Peter Neumann, SRI International EL301, 333
Ravenswood Ave., Menlo Park, California 94025. Please indicate
realistic minimum and maximum lengths of time that you feel would be
appropriate for your talk. Authors will be notified by 1 March 1982.
Revised versions of the accepted papers should be returned by 12 April
in camera-ready form to guarantee their being available for
distribution at the conference. In order to keep the sessions as
timely as possible, late entries may also be considered in cases of
high relevance, subject to remaining review time and program space.
However, in such cases early notification of intent would be
appreciated. In addition to the papers and panels, time will be
allocated for informal discussions.
-------
∂17-Sep-81 1440 ADMIN.BOSACK@SU-SCORE (SuNet) Lab Equipment
Mail-from: ARPANET host SU-SCORE rcvd at 17-Sep-81 1435-PDT
Date: 17 Sep 1981 1434-PDT
From: Len Bosack <ADMIN.BOSACK at SU-SCORE at SUMEX-AIM>
Subject: Lab Equipment
To: equip at SU-SHASTA
In the deliberations about future hardware, I think we should include
lab equipment as a line item. Our current equipment is, on the whole, a
bad joke. If we want to maintain (regain?) an ability to do hardware,
we really need to buy new lab equipment. A hardware development and
debugging capability will be ever more important when the CIS wafer
line is running right next store.
For purposes of discussion, I suggest we plan $35K per year for
lab equipment. These days, $35K buys ONE good workstation. At the end of
the three years, we would have three fully-capable hardware workstations.
Len Bosack
-------
∂17-Sep-81 1537 FFL
To: JMC, FFL
Dina Bolla Travel called to say that they checked with VISA and you have
overdrawn your limit so they will not accept the $l673 charge for your
ticket to Germany.
∂17-Sep-81 1848 pratt@Diablo (SuNet) equip@shasta -> equip@diablo
Date: 17 Sep 1981 18:42:42-PDT
From: pratt at Diablo
To: equip
Subject: equip@shasta -> equip@diablo
Shasta is moving to ERL, and will be down starting Friday for the better part
of a week. A copy of the equip mailing list exists on Diablo; send mail to
equip@diablo rather than equip@shasta. (One day all the mailers on Stanford
will be coordinated and permit you to mail simply to equip, or to
equip@stanford from non-Stanford hosts.)
∂18-Sep-81 1000 FFL
To: JMC, FFL
Call about Context Advisory Council again. Considering Friday, Oct. 9, for
next meeting instead of Oct. 2. Have both days on your calendar until I
hear definitely about the date.
∂18-Sep-81 1001 FFL mail jmc,ffl
To: JMC, FFL
Yvonne Emsellem from the Order and Disorder Conference wishes to see you
on Tuesday, Sept. 22, at 1:30 p.m., or any other agreeable hour. Can be
reached at Faculty Club, 497-4703. I have it on your calendar and she is
coming unless notified to the contrary.
∂18-Sep-81 1003 FFL Call from Endres, of IBM, Germany
To: JMC, FFL
Will have a car pick you up on 27th at Cologne-Bonn airport at 3:30 pm.
Will take you to Stuttgart when the time comes. He wanted to be assured that
you were going to Stuttgart. I told him you were planning to do so.
∂18-Sep-81 1051 FFL
To: JMC, FFL
A man named Goerz who said he met you in Vancouver. Is a German doing research
at UCLA this year. I set up an appointment with you for Tuesday, Sept. 22,
at 2:30 p.m. If this is not satisfactory, a message may be sent to him at
Colby at Sumex.
∂18-Sep-81 1544 FFL
To: JMC, FFL
I am concerned about your ticket to Germany getting here on time. Is there
another way we can handle the charge at Bolla's since your Visa is evidently
over the limit if the $1,600 for the ticket is added. We should do something
about it Monday.
I suppose I'll give you a check Monday or even Tuesday. I'll leave you a
message over the weekend about the ticket and about those appointments you
have tentatively made for me.
∂18-Sep-81 1606 CLT
I'm back, will be here til around 6:30. Chris says you called.
∂18-Sep-81 2118 ARK Fourth Annual "See You In September" Party
To: "@PARTY.DIS[1,ARK]" at SU-AI
To kick off the 1981-1982 party season, my housemates (Doug Appelt, Greg
Boyd, Joan Feigenbaum (no relation) and a player to be named later) and I
are having the Fourth Annual "See You In September" Party. This
one-of-a-lifetime event will be on Saturday, 26 September, from 8 p.m.
until dawn at 3400 Kenneth, Palo Alto, off Greer near Loma Verde. Maps
are posted on most CSD bulletin boards, and extras are by the
receptionists desk in MJH.
This gala event is being held for the following reasons:
1. To give new CS students a chance to meet people.
2. To welcome our new housemates into the fold.
3. To celebrate Joan's birthday.
4. To celebrate Greg's birthday.
5. To celebrate Doug getting close to finishing his Ph.D.
6. As a housewarming.
Come prepared for some serious carousing. We will furnish a keg of above
average beer, and some miscellaneous goodies. If you have favorite
consumables, please don't feel inhibited about bringing them.
Arthur Keller
∂19-Sep-81 0931 JRP terminals
I can return your terminal any time now. Where should it be
brought?
Thanks for the advice about ambassadors. I have heard good things
about them, I think from Stan Peters.
I have temporary use of a datameda 2500 (from Suppes), and have found
funds to buy a terminal, probably either an ambassador, or a new
terminal from product associates (I forget exactly what it is) that
is most similar to the one i am returning to you. The ambassador's
ability to displacy up to 60 lines is very attractive, but then so
are the logical characters. Any further advice you want to send my
way on such a choice? In any case, be sure to tell me where to
return your datamedia--and heartfelt thanks again for its use this
summer. j perry.
Please return the terminal to Martin Frost in Room 030 Margaret Jacks
Hall. If he isn't there leave a note stating that it is one I lent you.
If you plan to continue using SAIL, discuss what terminal you buy with
Martin or Ralph unless it is one that SAIL already supports. The point is
that each terminal has its peculiarities, and its use is more or less
convenient depending on whether SAIL know about that terminal, and Martin
will probably decline to do a lot of work for a terminal of which only one
is bought. Of course, the same considerations apply to any other system
you may contemplate using. I'm glad you got good use from the terminal.
Tell me more about the new Product Associates terminal.
∂19-Sep-81 1553 ullman@Diablo (SuNet) equip@shasta -> equip@diablo
Date: 19 Sep 1981 15:44:34-PDT
From: ullman at Diablo
To: equip, pratt
Subject: equip@shasta -> equip@diablo
∂19-Sep-81 1943 RPG Terminal
If there is a DM around that I can have for home usage, I wouldn't mind
getting onto a queue for one.
-rpg-
What a coincidence that you should ask. John Perry of the philosophy
department (JRP) is returning one momentarily. I suggest you contact
him and arrange to pick it up.
∂19-Sep-81 2141 CLT aliquots
due to the new and wonderous accounting system, i need an additional
allocation of 200 blocks. ok?
OK for now. I'm also getting harassed, but I think we can afford to
increase our allocations according to our needs.
∂19-Sep-81 2308 Jerry E. Pournelle <POURNE at MIT-MC>
Date: 20 September 1981 02:08-EDT
From: Jerry E. Pournelle <POURNE at MIT-MC>
To: JMC at SU-AI
Excellent. See you thn. Promises to be an interesting session.
JEP
∂20-Sep-81 1529 CLT
ill go grocery shopping with you later if you like,
(but preferably >10 minutes before closing).
OK, I'll be there at 5pm with shopping list.
∂20-Sep-81 1616 Richard M. Stallman <RMS at MIT-AI> Emacs
Date: 20 September 1981 19:14-EDT
From: Richard M. Stallman <RMS at MIT-AI>
Subject: Emacs
To: JMC at SU-AI
I'll fix the manual for the next version.
∂20-Sep-81 1637 TOB VAX buy
To: admin.gorin at SU-SCORE, csd.feigenbaum at SU-SCORE, JMC at SU-AI
I am very interested in an undetermined number of
them. We stand a very good chance of getting a
large VAX 11/780 system. The VAX 11/750 seems
preferable. We may want as many as six of them.
When do we need to make a definite answer? It will
take me some time to know the state of the new contract
and what substitution arrangements we can make.
Tom
My immediate reaction is that six Vaxen is enormous overkill, and
you probably won't get them, and you'll be sorry if you do. We need
to discuss it.
∂20-Sep-81 1747 TOB
John
I am open to talking and considering alternative plans for computing.
Unless arrangements are made which offer something better than
what we can get otherwise, no one will opt for combined facilities.
These are what I want from a solution:
greatly increased file resources
greatly increased computing cycles
array processing or similar compute power
real time control
a VAX adequate for Image Understanding research;
ACRONYM seems destined to be important in IU
the IU community has VAX as de facto standard
resources that we can count on in the future;
some autonomy or effective guarantees that the system
we use will not be overloaded
I think that the current organization will overload any computer resources.
It is important to us to have some resources we can count on.
I do not think that a DEC 2060 plus retiring SAIL would improve the situation
at all. It would not provide us with a VAX and it would not improve the
cycle famine. A DEC 2080 is still a machine with small address space and
not enough cycles; i.e. too little and too late.
Our original plan was a VAX 11/780 with array processing. We had agreed
that you could use it.
Best Regards
Tom
∂21-Sep-81 0401 TOB computing
I did not mention that I value your judgment and I am eager
to have your leadership concerning computer systems. I
tend to favor solutions favoring pooled resources, however
with restricted access.
Tom
I guess I got over excited, and I'll get back to you with more considered
reasoning about why I think we should be cautious about acquiring too
much equipment and how it might apply to the present case. The argument
about VAX becoming standard for vision and assembly work has great force,
however.
∂21-Sep-81 1012 CG disk space
The disk space pricing change has put me 30% over allocation. Although
I'll do some file aglomeration to reduce block usage, I don't think this
will entirely solve the problem, so I will need an increase in my allocation.
Unfortunately, I'm already using my entire NSF computer
resources budget. So I'm one of the people who can't
afford the 40% price increase which has accompanied change from
word to block pricing. I'm hoping that the price of an aliquot will
be revised downwards in response to reactions from abused users, but
if this doesn't happen, would it be possible for me to get two or three
ARPA funded aliquots?
Chris
Something will have to be done. I'll be in tomorrow.
∂21-Sep-81 1237 RPG terminal
I picked it up from JRP this morning, and it is now at my house.
I didn't have the correct phone hardware, otherwise I would have
mailed the ID numbers to you.
-rpg-
Please inform ME that you have it now.
Are you planning to go to LLL on Thursday? I need to get there,
to go to L.A. with Lowell, but I will be returning to SFO.
∂21-Sep-81 1251 JK rewriting
I wrote up a proposal for the re-writing language that we have talked
about - it is in rew.doc[ekl,jjw]. I think it is a sensible compromise -
one could think of fancier features like conditionals in the language
itself etc. but this would complicate things quite a bit.
Let me know if you have any comments on it.
I'll try to figure it out, but perhaps we'll have to try it and see
what proofs it shortens.
∂21-Sep-81 1256 RPG
∂21-Sep-81 1253 JMC
Please inform ME that you have it now.
Are you planning to go to LLL on Thursday? I need to get there,
to go to L.A. with Lowell, but I will be returning to SFO.
I might be going thursday, but I won't know until tonight
because my father may fly out for a visit tomorrow.
-rpg-
∂21-Sep-81 1257 JRP terminal
Dick Gabriel now has the terminal. Thanks again.
∂21-Sep-81 1251 RWW
John I have sent this to REG about the new charging scheme
I now get 1050 blocks and am over by 733 whereas yesterday I was
ok. THAT SEEMS LIKE A BIG DIFFERENCE!!!!!
PS: It will take me about a month to compress all this. I don't expect to
charged.
PPS: This new allocation scheme makes E a much less interesting editor
as we get charged for all ITS empty space. I don't think the
new allocation schemes take into account decisions that were made
long ago and have influenced how programs were written.
PPPS: Also I pay quite a lot for disk storage and a good part of the
time I cannot use the machine because there are no dd channels.
Thus I cannot get my share of the computing resourses although
I pay a great deal. All these "little" users that you mention are
subsidized under this scheme. Being logged out when I go to the
bathroom is not reasonable and I will write code to protect my
ability to get and keep channels if necessary.
Richard
∂21-Sep-81 1440 REG
∂21-Sep-81 1155 JMC
Will you be in tomorrow to discuss finances of SAIL?
---
No. How about Wednesday afternoon?
∂21-Sep-81 2021 Mark Crispin <Admin.MRC at SU-SCORE> PROLOG tape
Date: 21 Sep 1981 2018-PDT
From: Mark Crispin <Admin.MRC at SU-SCORE>
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041
Phone: (415) 497-1407 (Stanford); (415) 941-1096 (residence)
Subject: PROLOG tape
To: JMC at SU-AI
I have the PROLOG tape on my desk, please stop by and see me whenever
you want to do something with it.
-- Mark --
-------
I have forgotten what PROLOG tape it is.
∂21-Sep-81 2105 Mark Crispin <Admin.MRC at SU-SCORE>
Date: 21 Sep 1981 2104-PDT
From: Mark Crispin <Admin.MRC at SU-SCORE>
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041
Phone: (415) 497-1407 (Stanford); (415) 941-1096 (residence)
To: JMC at SU-AI
In-Reply-To: Your message of 21-Sep-81 2055-PDT
ISN'T IT A TAPE WITH NEW STUFF?
-------
∂21-Sep-81 2216 LGC 1. Colloquium 2. Castaneda account?
1. Prospects are looking reasonably good for an interesting colloquium on
philosophy in AI, covering aspects of causal reasoning, situation semantics,
and (possibly) action theory. Possible contributors include JMC, LGC, JRP,
and maybe Castaneda and/or Bratman. You mentioned earlier that you might be
able to provide two talks for such a colloquium; what would the subject be,
and when might you want to give them?
2. Hector Castaneda (a philosopher at CASBS) has looked through Weissman's
LISP Primer, and would now like to experiment a little with LISP on a
computer. What are his chances of getting an account on SAIL for this
purpose? (He is willing to use the "public" terminals in MJH until he can
arrange for a terminal in his office, or failing that, for the duration of his
fellowship). If you're in tomorrow, perhaps I can introduce him to you.
By the way, the biography of Castaneda that I gave you erroneously listed his
year of birth as 1912; in fact, it is 1924 or '25. He was one of my very
first teachers of philosophy back in the early '60s. -- Lew
I will be in tomorrow (Tuesday) and then not for a week.
∂21-Sep-81 2223 reid@Diablo (SuNet) sun workstations and Dolphins
Date: 21 Sep 1981 22:19:15-PDT
From: reid at Diablo
To: equip
Subject: sun workstations and Dolphins
I had a conversation this evening with Larry Masinter, at which he
suggested that it would be a very easy thing to modify Interlisp-D
so that it could use Peter Deutsch's remote raster protocol to drive
a SUN workstation. By writing a simple server program on a SUN, it
would be possible to "telnet" to a Dolphin from a SUN and use the
Dolphin remotely. This would provide a very cheap way of distributing
the compute power of a Dolphin to people who don't have one physically
in their office.
∂22-Sep-81 0823 JK
∂21-Sep-81 1313 JMC
I'll try to figure it out, but perhaps we'll have to try it and see
what proofs it shortens.
-------------
o.k. - I'll start coding
∂22-Sep-81 0906 Gene Golub <CSD.GOLUB at SU-SCORE> call
Date: 22 Sep 1981 0905-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: call
To: jmc at SU-AI
cc: CSD.GOLUB at SU-SCORE
Sorry I didn't return your call last night but I got in rather late.
I'll try to get you yhis afternoon.
GENE
-------
∂22-Sep-81 0915 UNTULIS at SRI-AI New badge
Date: 22 Sep 1981 0904-PDT
From: UNTULIS at SRI-AI
Subject: New badge
To: jmc at SU-AI
cc: untulis at SRI-AI, navarro at SRI-AI
I have a new badge for you. Please stop by and pick it up.
Thanks
Chuck
-------
∂22-Sep-81 1000 JMC*
bank
∂22-Sep-81 1000 JMC*
suppes, amex,
∂22-Sep-81 1401 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) MTC Qual
Date: 22 Sep 1981 1357-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: MTC Qual
To: JMC at SU-AI, CSD.DBrown at SU-SCORE
John, I need the updated reading list material for the MTC Qual by
Monday, Registration Day.
Carolyn
-------
∂22-Sep-81 1814 Richard M. Stallman <RMS at MIT-AI>
Date: 22 September 1981 21:12-EDT
From: Richard M. Stallman <RMS at MIT-AI>
To: JMC at SU-AI
I just FTPed another version of your paper. Tomorrow I'll
try to SCRIBE it. However, it looks a lot better and
more comprehensible than the previous version. However,
so far it shows no sign of comprehending the issues
involved in circumscription.
What issues do you mean?
1. Non-monotonicity doesn't prevent a system from being
recursively enumerable. If the opportunities for default
reasoning at any point in the argument and the requirements
for taking back previous results are both effectively
computable, then the set ofstates of belief are
recursively enumerable just as is the set of theorems
of an ordinary theory.
Yes, you can enumerate the things that can get proved, but if the
proof uses a default, there is no way of telling that the default
won't be retracted later. So there is no way to enumerate the
theorems. Isn't this so?
If you mean by theorems, the sentences that can never be taken
back no matter what information subsequently develops, you are
right, assuming that no false information ever appears. Namely,
if by non-monotonic reasoning we get a conclusion that is true
but unprovable, then we'll never have to take it back, and
the true sentences are not recursively enumerable. I'm
∂23-Sep-81 0814 FFL Telegram
To: JMC, FFL
The 7th IBM Symposium on Mathematical Foundations of Computer Science, l982.
Reference my letter dated September 8. Will hold organizing committee on the
Symposium on 9/28. Could you kindly advise if you accept our invitation
so that we can finalize the program. Would appreciate if you could reply by
9/25. Thanks in advance and best regards. Y. Kuroda, Manager, Public
Programs, IBM Japan.
∂23-Sep-81 0900 FFL Telegram
To: JMC, FFL
Subject; Computer SC Sumposium, Sept. 28-30.
Bad Neuenahr. The driver will meet you upon arrival with LH057/3.35 p.m.
at the airport, Cologne at the arrival hall/"meeting point" to bring you to the
Hotel Steigenberger. He will have an IBM sign in his hand.
Mrs. E. Roehm, Stuttgart, IBM Germany
.
∂23-Sep-81 0849 TOB
John
Thank you for your efforts on my behalf.
I am happy about this.
Tom
∂22-Sep-81 2200 Gene Golub <CSD.GOLUB at SU-SCORE> congratulations
Date: 22 Sep 1981 2157-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: congratulations
To: tob at SU-AI
cc: CSD.GOLUB at SU-SCORE
Tom!
congratulations! the board of trustees has approved your appointment as an adjunct professor.
Gene Golub
-------
∂23-Sep-81 0956 RPG
∂23-Sep-81 0025 JMC
What are prospects of your going to Livermore Thursday?
My father and I are going to Yosemite tomorrow and will
be driving past LLL at 8am! If you want to ride over at 7
we'd be happy to take you.
About aliquots, LLL, CF, and you(?) all pay for part of my allocation.
To get under allocation by aliquot purchase requires another 250 blocks!
This is even though I was under my allocation of 1080k words by 250k!
Thanks for your ride offer. It's a bit of a last resort. Can I phone
you this evening in case I want to take you up on it and at what number?
∂23-Sep-81 1000 RPG
∂23-Sep-81 0959 JMC
Thanks for your ride offer. It's a bit of a last resort. Can I phone
you this evening in case I want to take you up on it and at what number?
Sure. 494-1932. I'll be at school today, too.
-rpg-
∂23-Sep-81 1013 FFL
To: JMC, FFL
Elizabeth Tinkhasoz called re literature about computer medical diagnosis.
Please call 212 535 5500, extension 114.
∂23-Sep-81 1014 FFL Fred Abramson computer files
To: JMC, FFL
When Fred left, he told me that as far as he was concerned the files could
be wiped out. Then he said he would talk to you to see if you wanted any
of them. If you do not want them, we should get rid of them as they are
costing about $40 a month.
∂23-Sep-81 1059 Mark Crispin <Admin.MRC at SU-SCORE> [HEDRICK at RUTGERS (Mngr DEC-20's/Dir LCSR Comp Facility): edit 9-23-81]
Date: 23 Sep 1981 1053-PDT
From: Mark Crispin <Admin.MRC at SU-SCORE>
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041
Phone: (415) 497-1407 (Stanford); (415) 968-1052 (residence)
Subject: [HEDRICK at RUTGERS (Mngr DEC-20's/Dir LCSR Comp Facility): edit 9-23-81]
To: JMC at SU-AI, CSD.Feigenbaum at SU-SCORE, REG at SU-AI, RPG at SU-AI
For your information - (extended addressing Lisp on a DECSYSTEM-20)
---------------
Mail-from: ARPANET site RUTGERS rcvd at 22-Sep-81 2242-PDT
Date: 23 Sep 1981 0139-EDT
From: HEDRICK at RUTGERS (Mngr DEC-20's/Dir LCSR Comp Facility)
Subject: edit 9-23-81
To: steinberg at RUTGERS, mitchell at RUTGERS, sridharan at RUTGERS,
To: kastner at RUTGERS, josh at RUTGERS, lisp at RUTGERS, benson at UTAH-20,
To: griss at UTAH-20, maguire at UTAH-20, utgoff at RUTGERS, rsmith at RUTGERS,
To: admin.mrc at SU-SCORE, fischer at GREEN, lepreau at UTAH-20, cmp.cohen at UTEXAS-20,
To: cc.clive at UTEXAS-20, srinivasan at RUTGERS, cmp.mksmith at UTEXAS-20,
To: masinter at PARC-MAXC
I hope I am not boring you with this detailed edit history. However
this is the easiest way to
- respond to your bug reports, letting you know in what version
various bugs are fixed
- give you an idea of the seriousness or lack thereof of bugs that are
currently being found
We have now successfully converted one of our major research projects to
Elisp. The reports I am getting suggest that Elisp runs noticably
faster than R/UCI Lisp, although the compiler and LAP are slower. The
speedup should not be taken to indicate that there is no penalty for
extended addressing. I am still concerned about behavior of very big
core images, but of course the ones I have been using for test are
contrived, and probably it is going to be a while before any of the real
projects get that big. We have recently changed the garbage collector so
that all lists are made compact. I.e. the CDR is put in the next cell.
This GC takes slightly more time (less than 10%), but we are hoping the
result will be enough improvement in paging to justify this CPU time.
Note that I am currently working only on bug fixes. The compiler has
some known suboptimalities for which fixes are known, but which will
wait for a few weeks, until there are fewer bug reports. The most
serious of these causes functions to be called when they should be
coded in line (e.g. CAR, CDR, EQ).
--------------------------------------------------------------------
9-23-81
EDITV was an EXPR, should have been an FEXPR.
GLOBALMACRO defined as NILL in the interpreter. (Actually at the moment
it doesn't do anything in the compiler, either, since all macros are put
into the .LAP file.)
Fixed the compiler so that recursive REQUIRE and DSKIN are handled
correctly. I.e. previously the compiler would examine any files
REQUIRE'ed or DSKIN'ed, but not files REQUIRE'ed or DSKIN'ed by them.
Fixed LESSP. We had forgotten to remove a special pass 1 function for
LESSP. It was no longer needed, since CMACS contained a compiler macro
definition for it. The result was a confusion wherein neither
definition worked right, and a call was compiled to call the macro LESSP
as if it were an EXPR.
-------
---------------
-------
∂23-Sep-81 1120 EJG Travel to Livermore
At the moment, it seems quite likely that I will be heading to Livermore
Thursday morning, leaving Palo Alto around 9:30 AM. Where would you want
to be picked up, assuming that we confirm later today that we are both
going? It is also possible that I would spend the night in Livermore
rather than return to Palo Alto, but from what I understand you do not
want a ride back. Is this correct? - Erik
∂23-Sep-81 1446 Denny Brown <CSD.DBROWN at SU-SCORE> New student support
Date: 23 Sep 1981 1432-PDT
From: Denny Brown <CSD.DBROWN at SU-SCORE>
Stanford-Phone: (415) 497-2274
Subject: New student support
To: CSD-Faculty: ;
cc: csd.tajnai at SU-SCORE, csd.bscott at SU-SCORE, csd.sis at SU-SCORE
Reminder about new student support.
We do not assign new students to sources of support. Instead, we help put
faculty and students together and let them mutually agree to work together.
To help me direct traffic, please let me know how many new PhD students
you might be able to support. (And Masters if that is relevant.)
An answer of 0 is very important, much better than no response. This
will keep everybody (me, you, students) from wasting time.
There are still a few copies of the students' admissions materials
available if you'd like to pre-screen the group. See Sue Seabrook.
If you are especially interested in a student, let me know.
-Denny
-------
∂23-Sep-81 1542 FFL Money for your ARPA appointees.
To: JMC, FFL
We have delayed making the fall quarter appointments to your ARPA account
because the money has not come, and Betty Scott does not know how long we will have
to wait for it. (She was told, however, that the funds will start on October 1,
when the contract is finally OKed.
You have the following people whose fall appointments start October 1:
Creary Ketonen Gabriel Goad (50%)
Talcott Moses Weening
Some can be put on your NSF. Do you want the others put on your unrestricted
account, with that account to be repaid when the ARPA money comes? Perhaps
Richard Weyhrauch would take Moses for a quarter if you were to repay him by
carrying one of his student assistants later.
We need your decision about this, please.
It doesn't matter to me from what accounts we borrow. If possible, when the
money comes through I would prefer to change the charges retro-actively
rather than get involved in deals.
Goad is 100 percent for the fall. Check with Gabriel, but I think the
way we left it is that he would stay on Livermore payroll for the Fall.
∂23-Sep-81 1624 EJG Re: ride
OK, I'll see you at 9:30 tomorrow (Thursday) morning at 846 Lathrop, unless
you send me a message by 10pm tonight saying otherwise. - Erik
∂23-Sep-81 1637 RPG
∂23-Sep-81 1457 JMC extended numbers
The S-1 LISP implementation guide mentions RJF's design as described
in SYMSAC '76 proceedings. Who is RJF, and do you happen to have
this article?
RJF is Richard Fateman at Berkeley and I do not have this article.
-rpg-
∂23-Sep-81 1747 Bobrow at PARC-MAXC Summary of AI Board meeting, 8/25/81, and Journal Status
Date: 23 Sep 1981 17:40 PDT
Sender: Bobrow at PARC-MAXC
From: Bobrow at PARC-MAXC
Subject: Summary of AI Board meeting, 8/25/81, and Journal Status
To: "@[ivy]ai-board.dl"
cc: Bobrow, Dake, Hausladen
Reply-To: Bobrow
Dear Board Member:
The following is a summary of the business conducted at the board meeting of
the AI Journal on August 25, 1981.
1) Approval of correspondents. We have six regular correspondents, in the areas
of Philosophy (Dan Dennett), Cognitive Psychology (Zenon Pylyshyn), Vision
(Michael Brady), Robotics (Tomas Lozano Perez), Natural Language (Barbara
Grosz), and Software Engineering (Eric Sandewall). We expect to publish
modestly annotated bibliographies of interesting new publications (chosen by the
correspondents). Other similar annotated bibliographies will be a welcome
addition to the journal on a more irregular basis in areas which do not have as
much publication with overlap of interest.
2) A number candiates were approved as new members of the editorial board,
and I would like to welcome here Randy Davis, Barbara Grosz, Drew McDermott,
Judah Pearl, and Ray Perrault. Alain Colmerauer was also nominated, and I
have sent him a letter inviting him to join the board, and am hoping for an
affirmative response. For each of these new people, and for current members I
would appreciate receiving a response indicating how you want your name and
affiliation to be printed on the front inside cover, and a list of topics in AI
which are of interest to your. This provides some guidance to Pat and me about
what papers to send you for review. Current members of the board might send a
similar list. Also, please check how your name and affiliation appears, and let
me know if you want any changes.
3) We discussed how North Holland can better serve us and the AI community.
Willem Dijkhuis, publisher of the journal, joined us for this discussion. He
was quite supportive. North Holland has helped settle the reprinting question
raised by Jon Doyle by allowing the editor-in-chief to grant non-exclusive
rights to reprint articles.
There has been some problems with the North Holland production department,
and I believe these are now about straightened out, although I must apologize for
the most recent issue, Volume 16, No. 3. The table of contents on the back cover
indexed the first part of the total volume. The table of contents for this issue
was inside where the volume table of contents was printed. I am talking to the
production manager today to try to ensure that material not sent to us for
proofing is proofed carefully at North Holland.
4) As incentives to reviewers to get their reviews in on time, we decided that we
would print dates of when the paper was received, and when the reviewer
responded on the bottom of every paper. In addition, it was suggested that if a
review was very late, a reviewer be taken off a paper, and a note be sent to the
author naming the reviewer who held up the process. Please comment on this
last suggestion.
5) It was suggested that we have a short column of "books received", and
"papers accepted" so that people could know what was to come. To be effective,
this needs to be a quick turnaround activity with the publisher. I am
investigating this.
Thank you all again for your help. The fine editorial board is what keeps the
quality of the AI Journal so high.
Daniel G. Bobrow
Editor-in-chief
*** (copy sent by mail to those not on the ARPA net) ***
∂23-Sep-81 2046 RPG
I have read both multi and multiv and need to think about them a bit before
extensive comment.
-rpg-
I now think that the examples in MULTIV don't suffer much from the
restrictions in the COMMON LISP document.
∂23-Sep-81 2050 RPG students
Is the arpa contract able to support a student for the timing project?
If so I'd like to peruse the students to see what's what.
-rpg-
I don't want to support the LISP timing project without promise of
additional ARPA funds.
∂23-Sep-81 2055 CLT mvgcd
X[GRT,CLT]/4p has slightly improved version
∂23-Sep-81 2232 RPG
∂23-Sep-81 2158 JMC
I don't want to support the LISP timing project without promise of
additional ARPA funds.
Does that mean they haven't offered any funds? Englemore seemed to
think they would. I was asking under that assumption, of course.
-rpg-
I have heard nothing. I suggest you ask Englemore whom to contact in
ARPA.
∂23-Sep-81 2236 RPG
∂23-Sep-81 2234 JMC
I have heard nothing. I suggest you ask Englemore whom to contact in
ARPA.
ok. You will not be at the meeting friday? I hope we can start
talking about something else besides terminals soon. The possibility
of using Suns as a semi-remote gateway to Dolphins, Lisp Machines, and
th S-1, with a uniform interface makes them sound pretty nice to me.
Have you ever seen a demo of the E/Lisp interface?
-rpg-
No. I won't be there Friday. I'd like to see the E/Lisp demo, but
not tonight. What would be your reaction to the idea that the
Formal Reasoning Group pass (or almost pass) the first year in
exchange for a commitment to make up its share the following year.
Then we could see what worked out well.
∂23-Sep-81 2317 RPG
∂23-Sep-81 2241 JMC
No. I won't be there Friday. I'd like to see the E/Lisp demo, but
not tonight. What would be your reaction to the idea that the
Formal Reasoning Group pass (or almost pass) the first year in
exchange for a commitment to make up its share the following year.
Then we could see what worked out well.
I have mixed feelings:
1. I fear passing a year might mean passing 1/3 of our share.
2. I think we can take advantage of our share without sacrifice.
For example, a Lisp Machine will run the same code as an S-1.
If the Lisp Machine loses we can easily unload it to someone else (HPP)
and get the effect of passing, perhaps.
3. I don't see options crystalizing for computing much more than they
have already. The only hope for Lisp besides the S-1 is the Extended Perq,
which Fahlman thinks will be dominated by Symbolics Lisp Machine. We need
Lisp cycles before the S-1 arrives. The ELISP from Rutgers is not
a serious contender from our point of view because if the S-1 works,
or if the Jupiter works, we will run Common Lisp anyway, and ELISP isn't
Common Lisp. The VAX will never be a contender.
4. The only pig in a poke for us is the SUN, which will be bought anyway.
What would we sacrifice the first year?
∂24-Sep-81 0807 nowicki@Diablo (SuNet) RE: SUN WORKSTATIONS/DOLPHINS
Date: 23 Sep 1981 1035-PDT
From: Rindfleisch at SUMEX-AIM
Subject: RE: SUN WORKSTATIONS/DOLPHINS
To: Equip at SU-HPP-VAX
Developing a remote bit-mapped terminal interface between SUN's and
Dolphins (and Symbolics 3600's, PERQ's, LMI machines, etc.) sounds like
a super idea! What needs to be done to get started?
Tom R.
-------
∂24-Sep-81 0807 nowicki@Diablo (SuNet) DEC DEAL ON THE 11/750'S
Date: 23 Sep 1981 1110-PDT
From: Rindfleisch at SUMEX-AIM
Subject: DEC DEAL ON THE 11/750'S
To: Equip at SU-HPP-VAX
I got a call from Rick Peebles at DEC saying he would be the focus
for proposals coming in for the 11/750 workstations. I asked him
what he saw as the ground rules for proposed uses of the machines
and he was pretty vague. The only thing he mentioned was using them
for LISP workstations -- they are obviously worried about losing out
to Xerox, Symbolics, 3RCC, etc. He did not react negatively about
file server development. His number is (617) 493-8817 if anyone
wants to talk to him directly.
Tom R.
-------
∂24-Sep-81 0826 nowicki@Diablo (SuNet) ISI plans
Date: 24 Sep 1981 0825-PDT
From: Feigenbaum at SUMEX-AIM
Subject: ISI plans
To: equip at SU-HPP-VAX
cc: rindfleisch at SUMEX-AIM
The latest I have heard from ISI is this:
No PERQS. Get SYMBOLICS machines for LISP (say five or ten).
Get ten VAXs on the DEC deal, but use them all as "servers",
e.g. two for file servers, perhaps two for LISP servers, one for
a SCRIBE server, etc.; they want to "remote" the bit-map display
in just the way we are discussing . (Perhaps this fits DECs conception
of the deal, perhaps not).
Notice no Dolphins. They've opted for the bird in the bush, hoping for
more power/dollar.
Ed
-------
∂24-Sep-81 0844 pratt@Diablo (SuNet) Sun terminal -> Lisp machines
Date: 24 Sep 1981 08:33:55-PDT
From: pratt at Diablo
To: equip, lantz
Subject: Sun terminal -> Lisp machines
From: Rindfleisch at SUMEX-AIM
Subject: RE: SUN WORKSTATIONS/DOLPHINS
To: Equip at SU-HPP-VAX
Developing a remote bit-mapped terminal interface between SUN's and
Dolphins (and Symbolics 3600's, PERQ's, LMI machines, etc.) sounds like
a super idea! What needs to be done to get started?
Tom R.
-------
All these machines, including Suns, have comparable processor power (to within
a factor of two). Thus using one as a terminal to another would only make
sense for software reasons, namely the absence of Lisp. At $60,000 for a
Dolphin vs. $6,800 for a Sun, this seems most unfortunate. A Lisp on the Sun
would permit 9 times as many Lisp machines so we wouldn't have to queue up
for a Lisp machine during peak hours.
To address Tom's question, this seems like a network graphics issue, for which
there is currently an ARPA-sponsored project run by Keith Lantz. Keith, how
should this be handled?
∂24-Sep-81 0900 nowicki@Diablo (SuNet) [Bob Engelmore <CSD.ENGELMORE at SU-SCORE at SUMEX-AIM>: Revised Budget]
Mail-from: ARPANET host SU-SCORE rcvd at 24-Sep-81 0857-PDT
Date: 24 Sep 1981 0855-PDT
From: Bob Engelmore <CSD.ENGELMORE at SU-SCORE at SUMEX-AIM>
Subject: [Bob Engelmore <CSD.ENGELMORE at SU-SCORE at SUMEX-AIM>: Revised Budget]
To: equip at SU-SHASTA, equip at SU-HPP-VAX
Mail-from: ARPANET host SU-SCORE rcvd at 21-Sep-81 1612-PDT
Date: 21 Sep 1981 1607-PDT
From: Bob Engelmore <CSD.ENGELMORE at SU-SCORE at SUMEX-AIM>
Subject: Revised Budget
To: equip at SU-HPP-VAX
The following is my attempt to generate a 3-year budget for the
ARPA proposal, with an approximate $1M annual expenditure rate.
ITEM 1982 1983 1984 TOTAL
------------------------------------------------------------
1. S1 $500 $500
2. Dolphins (10) 360 240 600
3. Symbolics (5) 325 325
4. Central File Server 225 225
5. SUN work stations(60) 200 50 200 450
6. Low-cost terminals (50) 50 50 100
7. Ethernet equipment 55 55 110
8. Star printers (3) 30 60 90
9. SUVax 11/750 (5) 180 180
10. Local ethernet and local 300 300
file store purchase
and development
11. Maintenance 80 120 200 400
------------------------------------------------------------
TOTAL $1,180 $1,100 $1,000 $3,280
Comments:
1. The purchase of Symbolics 3600 machines is deferred until year 2,
because it will probably be at least October, 1982 before we receive and
have to pay for them. Also note that we might actually get as much as
750K as soon as the contract starts -- say March of next year -- and
then another $1M in October of next year, so there isn't exactly a whole
year between "Year 1" and "Year 2" as far as the dollars are concerned.
2. In the interest of yearly cost balancing, I put off the purchase of
the local file servers until year 3. Vaughn thinks this is a mistake,
that we will need the local file servers no later than year 2 (i.e.
sometime in early 1983) or we'll badly overload the central file server.
An alternate budget would be to put the local file server equipment in
the budget for year 2, buy more Sun stations in year 2, and defer the S1
purchase to year 3. I suspect John may have a different opinion on
this.
-------
-------
---------------
-------
-------
---------------
-------
∂24-Sep-81 0903 nowicki@Diablo (SuNet)
Date: 24 Sep 1981 0857-PDT
From: T. C. Rindfleisch <RINDFLEISCH at SUMEX-AIM>
Subject: Re: Sun terminal -> Lisp machines
To: pratt at SU-HPP-VAX, equip at SU-HPP-VAX, lantz at SU-HPP-VAX
cc: RINDFLEISCH at SUMEX-AIM
In-Reply-To: Your message of 24-Sep-81 0835-PDT
Did I hear you just volunteer to build a Lisp environment for the SUN
of comparable quality and performance to the Dolphin/Symbolics systems,
Vaughan?
Tom R.
-------
∂24-Sep-81 0913 nowicki@Diablo (SuNet)
Date: 24 Sep 1981 0907-PDT
From: John McCarthy <JMC at SU-AI>
To: equip at DIABLO, (sunet)
An S-1 may be $650K. See you all next week.
∂24-Sep-81 0931 pratt@Diablo (SuNet) lisp on suns
Date: 24 Sep 1981 09:24:05-PDT
From: pratt at Diablo
To: equip
Subject: lisp on suns
Date: 24 Sep 1981 0857-PDT
From: T. C. Rindfleisch <RINDFLEISCH at SUMEX-AIM>
Subject: Re: Sun terminal -> Lisp machines
To: pratt at SU-HPP-VAX, equip at SU-HPP-VAX, lantz at SU-HPP-VAX
cc: RINDFLEISCH at SUMEX-AIM
In-Reply-To: Your message of 24-Sep-81 0835-PDT
Did I hear you just volunteer to build a Lisp environment for the SUN
of comparable quality and performance to the Dolphin/Symbolics systems,
Vaughan?
Tom R.
-------
I was pointing out the advantage of acquiring such a thing. For a project of
this magnitude I'd rather buy than build. In particular I'd like to see NIL
ported from the VAX to the 68000. The NIL project has been moving slowly, but
is far enough along now that such a port has a lead time comparable to that
associated with acquiring, e.g., Symbolics 3600's.
I am pretty sure one gives up some performance using 68000's in place of
Symbolics', but I'm not sure just how much. Note that microprocessors, the
68000 included, speed up as technology improves, just like their bit-slice
cousins, as will happen when we go from 8 MHz to 12 MHz 68000's, at which
time 68000's will be 60% of the speed of a Vax 11/780 and about the same as a
SU-Vax (and with a much better display)! Performance comparisons between the
68000 and future machines like the Symbolics 3600 should be made for future
(i.e. 12 MHz) 68000's.
Vaughan
∂24-Sep-81 0935 FFL
To: JMC, FFL
Thank you for the information from the FAculty Club bill. I will go ahead and
work on the expense reports for them. However, I will have to have a copy of
the Faculty Club bill to forward with the expense report.
∂24-Sep-81 0947 reid@Diablo (SuNet) lisp on suns
Date: 24 Sep 1981 09:40:51-PDT
From: reid at Diablo
To: equip, pratt
Subject: lisp on suns
Cc: lantz
Regardless of the presence or absence of a Lisp on a SUN, it will be
very worthwhile to have a Display-oriented TELNET facility on
the SUN so that one could, say, open a quarter of the SUN screen as a
graphics telnet window connected to an Interlisp running on a Dolphin.
This would allow the other 3/4ths of the SUN screen to be used for
other things, and all of the SUN compute power to be used for other
things (such as telnetting to yet another Dolphin, and running another
lisp job in another corner of the screen).
The Network Graphics contract is not just Keith; it is Keith and me.
He is more involved in the Network parts of it, and I am more involved
in the Graphics parts of it. Although we only got the money 4 days ago,
so it's not as if a whole lot of work has been done.
My conversation with Larry Masinter that led to this idea of using
SUN as a remote graphics telnet device to compute-servers running Lisp
came about because I had gone to talk to the Smalltalk people about
Peter Deutsch's new remote bitmap graphics protocol, with the intention
of learning about it for Network Graphics.
I will get a copy of the Deutch stuff; I read one over last week and
it looks wonderful. I think it will be fairly easy to graft it into
any raster display-oriented system; Masinter said specifically that it
would be very simple to graft it into Interlisp-D. More importantly,
Xerox wants to do this work, so that the standard distributed vanilla
Interlisp-D on a Dolphin would have this facility in it. Always better
to buy software than write it, and stealing is better than buying
in this case.
Brian
∂24-Sep-81 0954 pratt@Diablo (SuNet) S1 -> Foonly
Date: 24 Sep 1981 09:48:23-PDT
From: pratt at Diablo
To: equip
Subject: S1 -> Foonly
John Hennessy has suggested substituting a Foonly for the S1. I see three
advantages here. Foonlies are commercially available and even in use in
such places as SRI. They come with a decade and a half of software. And
they are cheap. (John, you seem to have the best contacts here, could
you ask Dave Poole what he'd charge to duplicate the power of an S1?)
I am also mildly sympathetic to the idea of a Foonly running a central file
server. However it is important to understand how the evolution of SUNet
impacts the role of a central file server. Next year we will be using the
Ethernet much more heavily than to date, and it will become essential to spin
off much of the usage into gateway-connected local nets, leaving the present
interbuilding network as a trunk line. (This will have to happen even sooner
if we continue to depend on mainframes for all significant cycles, as John
seems to want, as opposed to moving much of the computational load to more
local computers as I'd prefer.) A central file server then becomes an
impossible liability - it overloads both the gateways and the trunk
Ethernet. It is absolutely essential to the successful operation of SUNet
that each local net have its own file server. (It would also be nice for
each local net to have its own printing server, but as a lover of trees I'm
not pushing so hard for that one; people can continue to get their exercise
by walking to floor 2.)
Nevertheless it does make sense to get a central file server now, provided it
is understood that it will move down one storage hierarchy level when local
file servers are available (hopefully transparently to users), in that it will
be used for backup and for archiving files older than about a month (depending
on how local file servers meet the demand).
Vaughan
∂24-Sep-81 1030 FFL
To: JMC, FFL
Jack Cates asks that you call him. 321-1225.
∂24-Sep-81 1056 FFL CALL FROM BILL BUTTONWEISER, SE2, NYC
To: JMC, FFL
Please call NYC office if they have not already reached you today.
212 840 6595.
∂24-Sep-81 1203 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Cancellation of CS227 Autumn Quarter
Date: 24 Sep 1981 1159-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Cancellation of CS227 Autumn Quarter
To: BBoard at SU-SCORE, BBoard at SU-AI
cc: CSD-Faculty:
Tom Binford has canceled CS227 Autumn Quarter.
-------
∂24-Sep-81 2149 lantz@Diablo (SuNet) Sun terminal -> Lisp machines
Date: 24 Sep 1981 21:41:29-PDT
From: lantz at Diablo
To: equip, pratt
Subject: Sun terminal -> Lisp machines
The network graphics part of the project is directed towards VLSI design
aids; specifically, how to distribute functionality between SUN workstations
(or equivalent) and "crunchers" like the Vax. It is unlikely that machines
such as the Dolphin could substitute for Vaxen. Nevertheless, there is no
conceptual restriction on the machine at the "non-graphics" end of the wire;
hence, whatever we develop for network graphics might apply to other
applications using different machines.
I tend to agree with Vaughan and most other systems people and regard Dolphins
as incredibly bad investments.
Keith
∂24-Sep-81 2346 RPG@Sail (SuNet) Foonly's, S-1's, and Lisp
Date: 24 Sep 1981 2344-PDT
From: Dick Gabriel <RPG at SU-AI>
Subject: Foonly's, S-1's, and Lisp
To: equip at DIABLO, (sunet) at Sail
I have pretty good contacts with the S-1 project since I work full time
for them at the moment. I think that whoever suggested that a Foonly
of some vintage could replace an S-1 doesn't quite understand what an
S-1 is.
Something with the power of an S-1 could not look like a PDP-10 since it
would have to have a much larger address space and include many esoteric
instructions. It would have to be inherently a multiprocessor. Almost
none of the PDP-10 code could run on it. On the other hand, it might be
possible to get a PDP-10 emulation mode for the S-1 anyway.
One feature that the S-1 will have that is interesting is a very powerful
Lisp (Guy Steele, Rod Brooks, and I are writing it at this very moment).
To convince Poole to produce such a machine is equivalent to asking him to
either spend 20 man years of development and design or to steal the S-1
design outright.
About Lisp:
Am I insane or does no one else who uses Lisp believe that power/dollar is
totally irrelevant to the issues that AI Lisp programmers face? I don't care
that I could get 9 SUNs for the price of 1 Brand X Machine if that Brand X
machine is 5 times faster. I need that factor of 5; I don't need 8 SUNs keeping
me company in my office. The same argument goes for S-1's versus Foonlys.
If I argue that the department should not get too many Dolphins, it isn't because
I don't like Xerox, or that I don't like InterLisp (I've written a 20,000 line
InterLisp program, and hacked InterLisp for many years in the PSI project), or
that I don't like HPP. It is that I am suspicious that they do not provide the
absolute Lisp crunch power that Ed Feigenbaum and his programmers (who are
friends of mine) desparately need. If the Symbolics machines do not provide the
absolute crunch I will not reccommend buying them either. On this point I will
not yield: we must only consider the absolute amount of computation for the price
that we can afford.
I have some figures on the performance of the Dolphins compared to Dorado's and
2060's. I will bring these figures to the meeting tomorrow.
-rpg-
∂25-Sep-81 0749 FEIGENBAUM@SUMEX-AIM (SuNet) S1--Foonley
Date: 25 Sep 1981 0746-PDT
From: Feigenbaum at SUMEX-AIM
Subject: S1--Foonley
To: equip at SU-HPP-VAX
cc: feigenbaum at SUMEX-AIM
Vaughn, I'm confused on the following issue:
were you proposing to acquire a complement of existing Foonley
machines (with eighteen bit addresses); or asking Dave Poole to
design something different, that would give us many more address bits?
With regard to software that can use "big memory", you are wrong in assuming
that we have a decade and a half's worth of software (from TENEX and TOPS20).
Almost none of it takes advantage of bits beyond 18.
Edf
-------
∂25-Sep-81 0928 pratt@Diablo (SuNet) Foonly -> S1
Date: 25 Sep 1981 09:22:14-PDT
From: pratt at Diablo
To: equip
Subject: Foonly -> S1
Sorry, folks, I must have been asleep when I passed on that suggestion to
substitute Foonlies for S1's. I've been reminding people about the 68000's
24-bit address space so often the issue ought to be a reflex reaction with me
by now.
∂25-Sep-81 1639 RV CS206
Does cs206 involve programming? On which machine will it take place?
If the answer is LOTS, would it be possible to use sail instead?
If we are forced to use lots, that would be a good reason not to take
the class....Please respond as soon as you can to this message so I
can decide whether to take this class, and advise a friend also.
Rick Vistnes
∂25-Sep-81 2017 RPG Your secretary
apparently just forced me to decide that I am full time with LLL
this quarter. She seemed to think you decided it and was looking
for any objections from me. If this is a decision that you think is
reasonable and that you believe we made that's fine; if it is one
she made, I'm not too happy with how she approached me.
∂25-Sep-81 2212 RAK Off to the wilds of Massachusetts
To: "@FOO.[1,RAK]" at SU-AI
I seem to be off relatively soon to work for a startup computer company
somewhere near route 128 in Boston. The company doesn't have an office
yet, but I do have a home (although no phone until next week): 23 Jeffrey
Circle, Bedford, Ma, 01730. We'll be in the book when we get the phone,
so come by and visit or whatever if you ever get to our neck of the woods.
Dick Karp
∂26-Sep-81 0104 SOROKA at USC-ECLC the world is ready for robots
Date: 26 Sep 1981 0057-PDT
From: SOROKA at USC-ECLC
Subject: the world is ready for robots
To: jmc at SU-AI
A friend of mine called me up to say that the LA Times had a
photo of a robot greeting travellers at some exposition or other.
The robot rolled around and said appropriate witty things.
I told him that there was undoubtedly a human in the background
supplying motion commands and voice. He re-read the photo
caption more thoroughly and said I was right. What freaks me out
is that he wasn't at all disturbed by the thought that the show
robot might be intelligent. Are his reactions normal?
-------
∂28-Sep-81 0806 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Faculty Meeting TODAY
Date: 28 Sep 1981 0758-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Faculty Meeting TODAY
To: CSD-Faculty:
cc: CSD.BScott at SU-SCORE, Admin.Gorin at SU-SCORE, CSD.DBrown at SU-SCORE
The faculty meeting will be held today (MONDAY) at 2:30 p.m.
in Jacks 146 (Boys Town).
-------
∂28-Sep-81 0923 FFL TELEPHONE CALL FROM A BIONIC WOMAN
To: JMC, FFL
PETRITA DECIMA called and wishes you to call her back person-to-person,
209 578 9048. "I am a bionic woman. This means that I am living in a
symbiotic relationship to a computer. I badly need verification of this
and the best person to do this is someone in artificial intelligence.
May I expect Prof. McCarthy to call me back within a week." " I will
give him your message."
∂28-Sep-81 0933 FFL
To: JMC, FFL
Prof. Efron has scheduled a meeting of the Math-Science Committee for
Wednesday, October 7, at noon at the Faculty Club. If you cannot come,
please reply to 7-2627. It is on your calendar.
∂28-Sep-81 1020 CLT logic course
To: "@LOGIC.DIS[1,CLT]" at SU-AI
Math. 294. Topics in Logic and the Foundations of Mathematics.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The subject matter for this term will be: Theories featuring self-application.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
This is concerned with the search for strong workble consistent axiomatic
theories in which natural instances of self-application can be represented.
A variety of proposed solutions (both for mathematical and semantical notions)
will be considered.
Background assumed: model theory and recursion theory from Shoenfield's
Mathematical Logic (or equivalent).
~~~~~~~~~~~~~~~~~~
Meetings: Tu Th 1:15-2:30, Room 383P. (First meeting Th Oct. 1.)
~~~~~~~~
S. Feferman
[CLT ADDENDA --
(1) At the first meeting possible alternate times for meeting will
be discussed. I you would like to attend, but have a conflict
send me a note.
I am compiling a mailing list for sending occasional announcement
of logic courses, seminars etc. that might be of interest to
people in CS. The current list below. If you wish to be deleted
or know of someone I have missed, let me know.
Carolyn Talcott
LOGIC.DIS
JMC,JK,RWW,CG,FWH,LCG,VRP,SJF,
GOGUEN@SRI-KL,NILSSON@SRI-KL,WALDINGER@SRI-KL,KONOLIGE@SRI-KL
∂28-Sep-81 1155 Irmgild Schack <CSD.IRMGILD at SU-SCORE> Faculty Meetings
Date: 28 Sep 1981 1151-PDT
From: Irmgild Schack <CSD.IRMGILD at SU-SCORE>
Subject: Faculty Meetings
To: csd.buchanan at SU-SCORE, zm at SU-AI, csd.oliger at SU-SCORE, fb at SU-AI,
csd.feigenbaum at SU-SCORE, tw at SU-AI, csd.ullman at SU-SCORE,
als at SU-AI, csl.ejm at SU-SCORE, jmc at SU-AI, phy at SU-AI, jhg at SU-AI,
rwf at SU-AI, csd.golub at SU-SCORE
There will be a tenured faculty meeting the first Thursday of each
month, beginning Thursday, October 1. These meetings will be
concerned with the general directions of the department as well as
specific issues. The meetings will take place in the second floor
conference room, Room 252 and will begin at 2:30. I hope they will
last no longer than one hour and fifteen minutes. Please note that for
the fall quarter we will meet on October 1, November 5, and December 3.
-------
∂28-Sep-81 1333 FFL
To: JMC, FFL
Maria Rabland, 313 764 7053, called. Wants graduate info from you.
∂28-Sep-81 1402 LLW Re Our Recent Discussion. . .
To: JMC
CC: LLW
∂19-Sep-81 2127 HWC New allocation scam
To: REG
CC: ME, LLW, TM, bboard
While the new scheme of charging for resources consumed as opposed
to benefits received is rational, the conversion seems to have been
designed as a sleazy attempt to hide the raising of prices.
To begin with, the allocation unit of an entire track is much too
large to be reasonable. It would have been reasonable to attempt
the fix that before overcharging for a system shortcoming. But,
because of the way WAITS was designed this will probably stay with
SAIL to the detriment of all who try to use the system.
The new aliquots are smaller than the old aliquots. Are the prices
adjusted to account for this? Or is this an outright increase of 7%
in the cost of storage?
The new aliquots have not been adjusted to account for average
breakage. Most reputable computer vendors when changing equipment,
pricing policy or allocation schemes would try to tune the system so
that, on the average, the paying customers would see roughly the
same service and cost (excepting any declared pricing change). The
size of the aliquots should have been adjusted using information
about breakage on the system in order to give people about as much
storage as they have paid for. The current conversion amounts to an
inflation in the price of 30-50%. Note that the system is DESIGNED
with high breakage and therefore is the cause of much of the
inefficiency.
The managment of a computer system might choose to fix system
shortcomings; they might tune system parameters to avoid
inconveniencing their customers; they might even say "look, we are
losers so you guys will have to pay more". You, instead, have
chosen a rather cheap and sneaky way of making up for your own
failures. Furthermore, you have chosen to implement this dramatic
change overnight without prior notice to those who pay to support
you.
Much of the world is moving to distributed computing with
decentralized controls. Management like yours is helping it along.
∂29-Sep-81 0634 SAMET at USC-ISIF Game of LIFE
Date: 29 Sep 1981 0633-PDT
From: SAMET at USC-ISIF
Subject: Game of LIFE
To: mccarthy at SAIL
John,
One of my students has read your article titled "Ascribing mental qualities
to machines" in the book Philosophical Perspectives in Artificial Intelligence
(edited by Ringle) and had a number of questions which he has asked me to pass
to you.
1. You mention a private communication with Gosper re Turing machines.
Is it possible to get a copy of it?
2. You mention a magazine called Lifeline. How can one get a hold of a copy
of it and what is the address of the publisher?
Thanks and best regards.
Hanan,
-------
∂29-Sep-81 0905 Gene Golub <CSD.GOLUB at SU-SCORE> Forsythe Memorial Lectures
Date: 29 Sep 1981 0902-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Forsythe Memorial Lectures
To: CSD-Faculty: ;
The Forsythe Memorial Lectures will be given again this academic year.
If you recall, there are three lectures to be given in one week -- two
are of a tutorial nature and the other is more advanced. The lecturer
receives expenses plus a $1000 honorarium. Please send me suggested
names as soon as possible. David Cheriton and Rob Schreiber have
agreed to be members of the committee.
GENE
-------
∂29-Sep-81 0930 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Reception Thursday, Oct. 1, 4:30 p.m.
Date: 29 Sep 1981 0923-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Reception Thursday, Oct. 1, 4:30 p.m.
To: CSD-Faculty:
cc: CSD-Secretaries:
Everyone is invited to a Department Reception to welcome the new
students on Thursday, Octobet 1, 4:30 p.m., Psychology Courtyard
(lower level between Jacks and Psychology).
-------
∂29-Sep-81 1242 nowicki@Diablo (SuNet) Student representative
Date: 29 Sep 1981 12:39:51-PDT
From: nowicki at Diablo
To: equip
Subject: Student representative
Last spring I was elected at a student meeting to be on the "CSD facilities"
committee. There were a few meetings and then the project faded
away. Now I hear from various sources that a similar committee has
been formed and is meeting in secret. I certainly hope that it is an
oversight that there is no student representation on this committee.
There is, to put it mildly, a "bad feeling" about how the students are
being excluded from the decision-making process. Even a single token
member would ease some of the ill feeling that exists now. The
attitude seems to becoming more warlike, with students being asked to
join up with one of the camps. I was hoping we would be on the same side.
Although the student representative does not have to be me, I feel I would
be qualified, since I have experience with several of the proposed computer
systems (SUN workstations, DEC, and Xerox equipment), and even wrote
a paragraph or two in the CSL VLSI proposal.
-- Bill
∂29-Sep-81 1242 nowicki@Diablo (SuNet) Student representative
Date: 29 Sep 1981 12:39:51-PDT
From: nowicki at Diablo
To: equip
Subject: Student representative
Last spring I was elected at a student meeting to be on the "CSD facilities"
committee. There were a few meetings and then the project faded
away. Now I hear from various sources that a similar committee has
been formed and is meeting in secret. I certainly hope that it is an
oversight that there is no student representation on this committee.
There is, to put it mildly, a "bad feeling" about how the students are
being excluded from the decision-making process. Even a single token
member would ease some of the ill feeling that exists now. The
attitude seems to becoming more warlike, with students being asked to
join up with one of the camps. I was hoping we would be on the same side.
Although the student representative does not have to be me, I feel I would
be qualified, since I have experience with several of the proposed computer
systems (SUN workstations, DEC, and Xerox equipment), and even wrote
a paragraph or two in the CSL VLSI proposal.
-- Bill
∂29-Sep-81 1339 CSD.GOLUB@SU-SCORE (SuNet) Re: Student representative
Mail-from: ARPANET host SU-SCORE rcvd at 29-Sep-81 1336-PDT
Date: 29 Sep 1981 1334-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE at SUMEX-AIM>
Subject: Re: Student representative
To: nowicki at SU-HPP-VAX, equip at SU-HPP-VAX
cc: CSD.GOLUB at SU-SCORE at SUMEX-AIM
In-Reply-To: Your message of 29-Sep-81 1241-PDT
SORRY THAT I FORGOT TO INCLUDE A STUDENT IN THE ARPA PROPOSAL COMMITTEE.
THE COMMITTEE WAS HASTILY ASSEMBLED SOON AFTER I BECAME CHAIRMAN. THE
IMPORTANT THING WAS TO GET A PROPOSAL IN AND I WAS NOT INFORMED WHAT
HAPPENED PREVIOUSLY.NO THE MEETINGS ARE NOT HELD IN SECRET.HOW DID
YOU GET SUCH A SILLY IDEA? PERHAPS YOU SHOULD CHECK WITH JEFF ULLMAN
TO SEE WHETHER THERE IS A STUDENT CURRENTLY ON THE COMMITTEE.
I'D LIKE TO HEAR MORE ABOUT THESE BAD FEELINGS.COULD YOU AND/OR ANYONE
ELSE COME TO MY OFFICE AT 1:30 ON WEDNESDAY? WE SHOULD BE ABLE TO CLEAR
THE AIR. GENE
-------
∂29-Sep-81 1400 Denny Brown <CSD.DBROWN at SU-SCORE> CS200 - Call for speakers
Date: 29 Sep 1981 1346-PDT
From: Denny Brown <CSD.DBROWN at SU-SCORE>
Stanford-Phone: (415) 497-2274
Subject: CS200 - Call for speakers
To: CSD-Faculty: ;
cc: csd.sis at SU-SCORE
Informal description of CS200 for potential lecturers
CS200 meets Thursday, 2:45 to 4:00, in 320-320 during fall
quarter. I give the first lecture (on 10/1). There are nine more class
meetings. (Skip 11/26, finish 12/10). Contact me or Sue to request a
date for you or your group to do a presentation.
CS200 is intended to be an introduction to the research being done in the
Stanford CS Department. It is intended for entering students, in both the
PhD and Masters programs. The course is organized as a series of lectures
by CS faculty members. One unit of pass is available for attendance. The
course is intended to be (primarily) a forum for new students to meet
faculty members and to learn about current faculty interests and
activities. It is also a good way for a faculty member to attract
students to a pet project.
Each week a faculty member will be invited to present a lecture on what
his/her field is all about, what s/he is doing, and what sort of ongoing
projects s/he is involved in. The style of each lecture will certainly
vary depending on the speaker and his/her field of interest. I will
suggest the following questions as typical of the sort a speaker might
want to address.
Definition/description of the field of interest. What are the classical
questions of the field? What are the classical tools applied to discover
answers to the questions? In what courses, in what books, can one find a
good introduction to the field? What is a representative open problem?
(I.e. what is the speaker working on right now?) What contribution, if
any, can a new grad student make to a research project? How does a
student get involved in project activities? (E.g. SIGLUNCH for those
interested in HPP activities.) Can someone whose primary interests are
not in the field make a contribution to the research? (E.g. Graphics
programming in the NA world.) Where is the interesting research going on?
Who is doing it? How does the Stanford CS dept. stack up compared to
other places?
-Denny
-------
∂29-Sep-81 1602 pratt@Diablo (SuNet) student rep
Date: 29 Sep 1981 16:00:25-PDT
From: pratt at Diablo
To: equip
Subject: student rep
The closest thing to a student rep is Dick Gabriel, it would be a good
idea to have a genuine student. (You did graduate, right, Dick?)
Any student, or should (s)he be elected by the other students?
∂29-Sep-81 1614 RPG@Sail (SuNet) student rep
Date: 29 Sep 1981 1610-PDT
From: Dick Gabriel <RPG at SU-AI>
Subject: student rep
To: equip at DIABLO, (sunet) at Sail
∂29-Sep-81 1602 pratt@Diablo (SuNet) student rep
Date: 29 Sep 1981 16:00:09-PDT
From: pratt at Diablo
To: equip
Subject: student rep
The closest thing to a student rep is Dick Gabriel, it would be a good
idea to have a genuine student. (You did graduate, right, Dick?)
Any student, or should (s)he be elected by the other students?
Yes, I graduated last december. I have tried to keep the student opinion
in mind, but aside from terminals, where we have tried to provide
1 per person I didn't see where there was much choice for us to make.
Our hardware position is quite diversified.
-rpg-
∂29-Sep-81 2115 Charles Frankston <CBF at MIT-MC> Forwarded: OCR reply
Date: 30 September 1981 00:12-EDT
From: Charles Frankston <CBF at MIT-MC>
Subject: Forwarded: OCR reply
To: jmc at SU-AI, llw at SU-AI
Date: 25 Sep 1981 16:35:12 EDT (Friday)
To: Reply-to:
From: Mike Lease <mlease at BBN-UNIX>
Subject: OCR reply
In reply to John DeTreville's question (HN V4 #50), we have them right
now. Kurzweil Computer Products in Cambridge, Mass makes an OCR data
entry system which converts practically ANY font to ASCII. I used to
operate one of their machines, initially for KCP itself and later for
a data entry service bureau by the name of AlterText. How it works
is, the operator "trains" the system on the font to be scanned. This
takes about 20-30 minutes usually (given a reasonably experienced
operator), and once it is trained, the system can read the material
with very high accuracy and at speeds approaching 50K characters per
hour. The operator sees the material on a CRT as the machine reads
it, and has the opportunity to edit the material; either to make
corrections if needed, or to insert formatting codes of some kind. It
also has the capability to detect different fonts (italics, etc.) and
automatically insert a code indicating a new font (again, this
requires that the operator "train" the machine). Rather a nifty
little device, I thought (I WAS rather bored running it, though!). If
you want any more information, you can send a message to me --
MLEASE@BBN-UNIX.
Cheers,
Mike Lease
∂30-Sep-81 0911 ullman@Diablo (SuNet) Student representative
Date: 30 Sep 1981 09:06:50-PDT
From: ullman at Diablo
To: equip, nowicki
Subject: Student representative
I was under the assumption that Dick Gabriel was the student rep. I'm
happy to have input from all sides, and you're welcome to join the commitee.
∂30-Sep-81 0949 SIS Colloquium Notice - Week of 10/5/81 - 10/9/81
To: "@COLLOQ.DIS[INF,CSD]" at SU-AI
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
10/5/81 Math380C Wolfgang Hackbusch
Monday Numerical Analysis Ruhr-Universitat Bochum
4:15 p.m. Seminar ``Convergence of Multi-Grid Iterations Applied to
Difference Schemes''.
10/6/81 Jordan 041 Professor Michael Harrison
Tuesday Computer Science UC Berkeley
4:15 p.m. Colloquium ``Pumping [Pumping] Lemmas''.
10/7/81 Terman 153 Dick Gustafson
Wednesday Computer Systems IBM, Poughkeepsie, N.Y.
4:15 p.m. Laboratory Seminar ``IBM 3081 ARCHITECTURE''.
10/9/81 MJ301 Paul Martin
Friday Database Research SRI International
3:15 p.m. Seminar ``Transportable English Access Mechanism''. (Live
Demo)
∂30-Sep-81 1017 FFL
To: JMC, FFL
Joe Walsh of III has been trying to reach you in Germany. He asks
that you contact him immediately. 714 444 7607.
∂30-Sep-81 1353 CSD.TAJNAI at SU-SCORE (Carolyn Tajnai) Forum Prospect
Date: 30 Sep 1981 1346-PDT
From: CSD.TAJNAI at SU-SCORE (Carolyn Tajnai)
Subject: Forum Prospect
To: CSD-Faculty:
cc: CSD.DBrown at SU-SCORE
I just received a call from a man from a Consulting Firm inquiring about the
Forum. His main interest is to hire Ph.D.'s with 10 years of practical
experience. I told him I would inquire about the networking within the
faculty to see if the Forum could be of any help to them. They do not hire
anyone right out of school -- no entry-level positions. He was referred to
us by the Career Planning and Placement Center.
Please let me know your feelings on this. Also, let me know if one of
you is interested in following up on his call. I promised to let him know
one way or the other.
Thanks,
Carolyn
-------
∂30-Sep-81 1356 CSVAX.fateman at Berkeley history question
Date: 30 Sep 1981 11:41:50-PDT
From: CSVAX.fateman at Berkeley
To: mccarthy@su-ai, minsky@mit-ai
Subject: history question
Cc: dek@su-ai
In "Hints on Programming Language Design" (Stanford Univ. rep. CS-73-403),
C.A.R. Hoare states, concerning the CASE statement,
"This was my first programing language invention, of which I am still most
proud, since it appears to bear no trace of compensating disadvantage."
1. The SELECT construction in LISP 1.5 is quite similar, and perhaps
better in that it has an "otherwise" clause. Was this based on
Hoare's invention? Hoare seems to indicate his invention was
post-Algol-60 report.
2. If, as I suspect, Hoare "re-invented" this, are there
other re-inventions from LISP of a similar nature that
any of you would care to point out? (Ada "short circuit Boolean expressions"
of the form a and then b and then c come to mind ... (AND A B C) in
LISP.
Thanks.
∂30-Sep-81 1621 FFL Call from Debra Kiest, Sponsored Projects
To: JMC, FFL
Please call at 7-2633.
∂01-Oct-81 0000 JMC*
Change CMU lecture time.
∂01-Oct-81 0110 Richard M. Stallman <RMS at MIT-AI>
Date: 1 October 1981 04:07-EDT
From: Richard M. Stallman <RMS at MIT-AI>
Sender: RMS0 at MIT-AI
To: jmc at SU-AI
Have you read META yet?
Do you know whether you want to invite me?
Here's an idea I've been thinking about recently.
The idea is to make it possible to do dependency-directed backtracking
without keeping around the details of all the reasoning ever done.
group beliefs into "groups". Each group is given certain
premises (prior beliefs, taken from other groups). Reasoning
goes on within a group, and beliefs deduced inside the group
can be taken out and made premises of other groups. Such
beliefs are marked as conclusions of the groups they were
deduced in. So each group records its in-pointers and its
out-pointers.
The use of groups is that presumably the reasoning within
any one group doesn't take all that long to do over again.
So it is reasonable to throw away the "insides" of a group
that is probably not in question any more. If it needs
to be reconsidered, it can be redone. This gives a way to
trade size of data base against time.
Groups can themselves be grouped, and any group at any level
can be forgotten.
The decisions about when to start new groups presumably have
to do with explicitly recorded goals. In a circuit understander,
a group would probably be used for a relatively isolated subblock
of a complex circuit, such as a stage of an amplifier. If appropriate
rules about the stage can be deduced, they can be used to figure
out the behavior of the whole amplifier. In this case, the group
could explicitly mark which of the beliefs deduced in it ought to
be visible outside as conclusions.